Local solutions for global problems in wireless networks

DOI10.1016/j.jda.2006.05.004zbMath1130.05059OpenAlexW2075105933MaRDI QIDQ2466005

Jorge 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

zbMATH Keywords

routingdominating setslocal algorithmsad hoc and wireless networkslocal vertex coloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (9)

HARDNESS RESULTS FOR COMPUTING OPTIMAL LOCALLY GABRIEL GRAPHS ⋮ Modem illumination of monotone polygons ⋮ Local 7-coloring for planar subgraphs of unit disk graphs ⋮ Analysing local algorithms in location-aware quasi-unit-disk graphs ⋮ On the spectra of simplicial rook graphs ⋮ LOCAL CONSTRUCTION AND COLORING OF SPANNERS OF LOCATION AWARE UNIT DISK GRAPHS ⋮ A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks ⋮ Some problems in distributed computational geometry ⋮ Evolutionary design of oriented-tree networks using Cayley-type encodings

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• The expected size of some graphs in computational geometry
• The relative neighbourhood graph of a finite planar set
• Location-based localized alternate, disjoint and multi-path routing algorithms for wireless networks.
• Theoretical aspects of connectivity-based multi-hop positioning
• Geometric ad-hoc routing
• The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
• Approximate MST for UDG Locally
• Efficient Construction of Low Weight Bounded Degree Planar Spanner
• Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
• Structural Information and Communication Complexity
• DISTRIBUTED SPANNERS WITH BOUNDED DEGREE FOR WIRELESS AD HOC NETWORKS
• MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS
• Routing with guaranteed delivery in ad hoc wireless networks
• A dominating-set-based routing scheme in ad hoc wireless networks

This page was built for publication: Local solutions for global problems in wireless networks