Abstract
For c ∈ \(\mathbb R\), 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. In a weakc-spanner, this path may be arbitrary long but must remain within a disk 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 geometric distance of the direct link.
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 any weak spanner is also a uniform power spanner. We further generalize the latter notion by considering (c,δ)-power spanners where the sum of the δ-th powers of the lengths has to be bounded; so (·,2)-power spanners coincide with the usual power spanners and (·,1)-power spanners are classical spanners. Interestingly, these (·,δ)-power spanners form a strict hierarchy where the above results still hold for any δ ≥ 2; some even hold for δ > 1 while counterexamples exist for δ < 2. We show that every self-similar curve of fractal dimension d > δ is no (C,δ)-power spanner for any fixed C, in general.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alzoubi, K., Li, X.-Y., Wang, Y., Wan, P.J., Frieder, O.: Geometric spanners for wireless ad hoc networks. IEEE Transactions on Parallel and Distributed Systems 14(4), 408–421 (2003)
Eppstein, D.: The Geometry Junkyard: Fractals, http://www.ics.uci.edu/~eppstein/junkyard/fractal.html
Eppstein, D.: Beta-skeletons have unbounded dilation. Technical Report ICS-TR-96-15 (1996)
Eppstein, D.: Spanning trees and spanners. In: Handbook of Computational Geometry, pp. 425–461 (2000)
Fischer, M., Lukovszki, T., Ziegler, M.: Geometric searching in walkthrough animations with weak spanners in real time. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 163–174. Springer, Heidelberg (1998)
Fischer, M., Meyer auf der Heide, F., Strothmann, W.-B.: Dynamic data structures for realtime management of large geometric scenes. In: 5th Annual European Symposium on Algorithms (ESA 1997), pp. 157–170 (1997)
Grünewald, M., Lukovszki, T., Schindelhauer, C., Volbert, K.: Distributed maintenance of resource efficient wireless network topologies. In: Monien, B., Feldmann, R.L. (eds.) Euro-Par 2002. LNCS, vol. 2400, pp. 935–946. Springer, Heidelberg (2002)
Jia, L., Rajaraman, R., Scheideler, C.: On local algorithms for topology control and routing in ad hoc networks. In: Proc. 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2003), pp. 220–229 (2003)
Li, X.-Y., Wan, P.-J., Wang, Y.: Power efficient and sparse spanner for wireless ad hoc networks. In: IEEE International Conference on Computer Communications and Networks (ICCCN 2001), pp. 564–567 (2001)
Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., Grünewald, M.: Energy, congestion and dilation in radio networks. In: Proc. 14th Symposium on Parallel Algorithms and Architectures (SPAA 2002), pp. 230–237 (2002)
auf der Heide, F.M., Schindelhauer, C., Volbert, K., Grünewald, M.: Congestion, Dilation, and Energy in Radio Networks. Theory of Computing Systems 37(3), 343–370 (2004)
Rajaraman, R.: Topology control and routing in ad hoc networks: a survey. SIGACT News 33(2), 60–73 (2002)
Rao, S.B., Smith, W.D.: Approximating geometrical graphs via spanners and banyans. In: Proceedings of the 30th annual ACM symposium on Theory of computing, pp. 540–550 (1998)
Tricot, C.: Curves and Fractal Dimension. Springer, Heidelberg (1995)
Volbert, K.: Experimental Analysis of Adjustable Sectorized Topologies for Static Ad Hoc Networks. Accepted for DIALM-POMC (2004)
Wang, Y., Li, X.-Y.: Distributed Spanner with Bounded Degree for Wireless Ad Hoc Networks. In: Parallel and Distributed Computing Issues in Wireless networks and Mobile Computing, p. 120 (2002)
Wang, Y., Li, X.-Y., Wan, P.-J., Frieder, O.: Sparse power efficient topology for wireless networks. In: Proc. ACM Hawaii International Conference on System Sciences (HICSS 2002), p. 296 (2002)
Yao, A.C.-C.: On Constructing Minimum Spanning Trees in k-dimensional space and related problems. SIAM J. Comput. 11, 721–736 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schindelhauer, C., Volbert, K., Ziegler, M. (2004). Spanners, Weak Spanners, and Power Spanners for Wireless Networks. In: Fleischer, R., Trippen, G. (eds) Algorithms and Computation. ISAAC 2004. Lecture Notes in Computer Science, vol 3341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30551-4_69
Download citation
DOI: https://doi.org/10.1007/978-3-540-30551-4_69
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24131-7
Online ISBN: 978-3-540-30551-4
eBook Packages: Computer ScienceComputer Science (R0)