Local solutions for global problems in wireless networks
DOI10.1016/J.JDA.2006.05.004zbMATH Open1130.05059OpenAlexW2075105933MaRDI QIDQ2466005FDOQ2466005
Authors: J. Urrutia 
Publication date: 11 January 2008
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2006.05.004
Recommendations
- scientific article; zbMATH DE number 2040806
- scientific article; zbMATH DE number 2087296
- On the wireless local area network design problem with performance guarantees
- Localized techniques for broadcasting in wireless sensor networks
- Towards an accurate solution of wireless network design problems
- Optimal Wireless Networks Based on Local Channel State Information
- Localization in Wireless Networks
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Communication networks in operations research (90B18)
Cites Work
- A note on two problems in connexion with graphs
- The relative neighbourhood graph of a finite planar set
- Graph theory with applications
- Routing with guaranteed delivery in ad hoc wireless networks
- Geometric ad-hoc routing
- MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS
- The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
- A dominating-set-based routing scheme in ad hoc wireless networks
- The expected size of some graphs in computational geometry
- Approximate MST for UDG locally
- Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
- Theoretical aspects of connectivity-based multi-hop positioning
- Location-based localized alternate, disjoint and multi-path routing algorithms for wireless networks.
- DISTRIBUTED SPANNERS WITH BOUNDED DEGREE FOR WIRELESS AD HOC NETWORKS
- Structural Information and Communication Complexity
- Efficient construction of low weight bounded degree planar spanner
Cited In (11)
- Hardness results for computing optimal locally Gabriel graphs
- Local 7-coloring for planar subgraphs of unit disk graphs
- Evolutionary design of oriented-tree networks using Cayley-type encodings
- A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks
- Graph-Theoretic Concepts in Computer Science
- Some problems in distributed computational geometry
- Modem illumination of monotone polygons
- Local management of a global resource in a communication network
- Impact of locality on location aware unit disk graphs
- Analysing local algorithms in location-aware quasi-unit-disk graphs
- Local construction and coloring of spanners of location aware unit disk graphs
This page was built for publication: Local solutions for global problems in wireless networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2466005)
