Spanners, Weak Spanners, and Power Spanners for Wireless Networks

C. Schindelhauer, K. Volbert, M. Ziegler, in: Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), Springer , Berlin, Heidelberg, 2004, pp. 805–821.

Download
No fulltext has been uploaded.
Conference Paper | Published | English
Author
; ;
Abstract
For $c in REAL$, a $c$-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most $c$ times their geometric distance. Based on this property to approximate a complete weighted graph, sparse spanners have found many applications, e.g., in FPTAS, geometric searching, and radio networks. For geometric searching, it turned out to suffice whether the radius rather than the length of some path between any two vertices is bounded relatively to their geometric distance; this is the defining property of weak spanners. Finally regarding radio network applications, a power spanner accounts for the total energy afforded for a wireless transmission with the requirement that the sum of the squares of the lengths of some path between any two planar vertices must be bounded relatively to the square of their geometric distance (or higher powers up to 6 or even 8).<br><br>While it is known that any $c$-spanner is also both a weak $C_1$-spanner and a $C_2$-power spanner (for appropriate $C_1,C_2$ depending only on $c$ but not on the graph under consideration), we show that the converse fails: There exists a family of $c_1$-power spanners that are no weak $C$-spanners and also a family of weak $c_2$-spanners that are no $C$-spanners for any fixed $C$ (and thus no uniform spanners, either). However the deepest result of the present work reveals that, surprisingly, any weak spanner is also a uniform power spanner. We further generalize the latter notion by considering $(c,delta)$-power spanners where the sum of the $delta$-th powers of the lengths has to be bounded; so $(cdot,2)$-power spanners coincide with the usual power spanners and $(cdot,1)$-power spanners are classical spanners. Interestingly, these $(cdot,delta)$-power spanners form a strict hierarchy where the above results still hold for any $deltageq2$; some even hold for $delta>1$ while counterexamples reveal others to fail for $delta<2$. In fact we show that in general every self-similar curve of fractal dimension $d>delta$ is no $(C,delta)$-power spanner for any fixed $C$.
Publishing Year
Proceedings Title
Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC'04)
Volume
3341
Page
805-821
LibreCat-ID

Cite this

Schindelhauer C, Volbert K, Ziegler M. Spanners, Weak Spanners, and Power Spanners for Wireless Networks. In: Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04). Vol 3341. Berlin, Heidelberg: Springer ; 2004:805-821. doi:10.1007/978-3-540-30551-4_69
Schindelhauer, C., Volbert, K., & Ziegler, M. (2004). Spanners, Weak Spanners, and Power Spanners for Wireless Networks. In Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04) (Vol. 3341, pp. 805–821). Berlin, Heidelberg: Springer . https://doi.org/10.1007/978-3-540-30551-4_69
@inproceedings{Schindelhauer_Volbert_Ziegler_2004, place={Berlin, Heidelberg}, title={Spanners, Weak Spanners, and Power Spanners for Wireless Networks}, volume={3341}, DOI={10.1007/978-3-540-30551-4_69}, booktitle={Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04)}, publisher={Springer }, author={Schindelhauer, Christian and Volbert, Klaus and Ziegler, Martin}, year={2004}, pages={805–821} }
Schindelhauer, Christian, Klaus Volbert, and Martin Ziegler. “Spanners, Weak Spanners, and Power Spanners for Wireless Networks.” In Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), 3341:805–21. Berlin, Heidelberg: Springer , 2004. https://doi.org/10.1007/978-3-540-30551-4_69.
C. Schindelhauer, K. Volbert, and M. Ziegler, “Spanners, Weak Spanners, and Power Spanners for Wireless Networks,” in Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), 2004, vol. 3341, pp. 805–821.
Schindelhauer, Christian, et al. “Spanners, Weak Spanners, and Power Spanners for Wireless Networks.” Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), vol. 3341, Springer , 2004, pp. 805–21, doi:10.1007/978-3-540-30551-4_69.

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar
ISBN Search