DISTRIBUTED SPANNERS WITH BOUNDED DEGREE FOR WIRELESS AD HOC NETWORKS

DOI10.1142/S0129054103001674zbMATH Open1100.68648MaRDI QIDQ5696901FDOQ5696901

Xiangyang Li, Yu Wang, Ophir Frieder

Publication date: 19 October 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

optimizationspannerwireless ad hoc networkstopology controlpower consumption

Mathematics Subject Classification ID

Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Cites Work

• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
• The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric

Cited In (6)

• Primal dual based algorithm for degree-balanced spanning tree problem
• Distributed construction of low-interference spanners
• Odd Yao-Yao Graphs are Not Spanners
• Communication costs in a geometric communication network
• Local solutions for global problems in wireless networks
• Geometric spanners with applications in wireless networks

   Recommendations

• On geometric spanners of Euclidean and unit disk graphs 👍 👎
• On spanners and lightweight spanners of geometric graphs 👍 👎
• Minimum power assignment in wireless ad hoc networks with spanner property 👍 👎
• Geometric spanners with applications in wireless networks 👍 👎
• Computing Lightweight Spanners Locally 👍 👎

This page was built for publication: DISTRIBUTED SPANNERS WITH BOUNDED DEGREE FOR WIRELESS AD HOC NETWORKS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696901)