DISTRIBUTED SPANNERS WITH BOUNDED DEGREE FOR WIRELESS AD HOC NETWORKS

DOI10.1142/S0129054103001674zbMath1100.68648MaRDI QIDQ5696901

Yu Wang, Ophir Frieder, Xiang-Yang Li

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

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

Related Items (4)

Communication costs in a geometric communication network ⋮ Primal dual based algorithm for degree-balanced spanning tree problem ⋮ Local solutions for global problems in wireless networks ⋮ Odd Yao-Yao Graphs are Not Spanners

Cites Work

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

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