Sciweavers

Share
COMGEO
2007
ACM

Geometric spanners with applications in wireless networks

11 years 8 months ago
Geometric spanners with applications in wireless networks
In this paper we investigate the relations between spanners, weak spanners, and power spanners in RD for any dimension D and apply our results to topology control in wireless networks. For c ∈ R, a c-spanner is a subgraph of the complete Euclidean graph satisfying the condition that between any two vertices there exists a path of length at most c-times their Euclidean distance. Based on this ability to approximate the complete Euclidean graph, sparse spanners have found many applications, e.g., in FPTAS, geometric searching, and radio networks. In a weak c-spanner, this path may be arbitrarily long, but must remain within a disk or sphere of radius c-times the Euclidean distance between the vertices. Finally in a c-power spanner, the total energy consumed on such a path, where the energy is given by the sum of the squares of the edge lengths on this path, must be at most c-times the square of the Euclidean distance of the direct edge or communication link. While it is known that any...
Christian Schindelhauer, Klaus Volbert, Martin Zie
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2007
Where COMGEO
Authors Christian Schindelhauer, Klaus Volbert, Martin Ziegler
Comments (0)
books