Local solutions for global problems in wireless networks

DOI10.1016/J.JDA.2006.05.004MaRDI QIDQ2466005zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

dominating setsroutinglocal algorithmsad hoc and wireless networkslocal vertex coloring

Mathematics Subject Classification ID

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)

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

Cites work

• A dominating-set-based routing scheme in ad hoc wireless networks
• A note on two problems in connexion with graphs
• Approximate MST for UDG locally
• DISTRIBUTED SPANNERS WITH BOUNDED DEGREE FOR WIRELESS AD HOC NETWORKS
• Efficient construction of low weight bounded degree planar spanner
• Geometric ad-hoc routing
• Graph theory with applications
• Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
• Location-based localized alternate, disjoint and multi-path routing algorithms for wireless 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
• Structural Information and Communication Complexity
• The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
• The expected size of some graphs in computational geometry
• The relative neighbourhood graph of a finite planar set
• Theoretical aspects of connectivity-based multi-hop positioning

Cited in

(11)

• Local construction and coloring of spanners of location aware unit disk graphs
• 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
• Some problems in distributed computational geometry
• Graph-Theoretic Concepts in Computer Science
• Modem illumination of monotone polygons
• Impact of locality on location aware unit disk graphs
• Local management of a global resource in a communication network
• Analysing local algorithms in location-aware quasi-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)