Skip to main content
Article thumbnail
Location of Repository

Localized Spanners for Wireless Networks

By Mirela Damian and Sriram V. Pemmaraju


Abstract. We present a new efficient localized algorithm to construct, for any given quasi-unit disk graph G = (V, E) and any ε> 0, a (1 + ε)spanner for G of maximum degree O(1) and total weight O(ω(MST)), where ω(MST) denotes the weight of a minimum spanning tree for V. We further show that similar localized techniques can be used to construct, for a given unit disk graph G = (V, E), a planar Cdel(1+ε)(1+ π 2)-spanner for G of maximum degree O(1) and total weight O(ω(MST)). Here Cdel denotes the stretch factor of the unit Delaunay triangulation for V. Both constructions can be completed in O(1) communication rounds, and require each node to know its own coordinates.

OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.