Spanners, Weak Spanners, and Power Spanners for Wireless Networks

  • Christian Schindelhauer
  • Klaus Volbert
  • Martin Ziegler
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3341)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    Eppstein, D.: The Geometry Junkyard: Fractals,
  3. 3.
    Eppstein, D.: Beta-skeletons have unbounded dilation. Technical Report ICS-TR-96-15 (1996)Google Scholar
  4. 4.
    Eppstein, D.: Spanning trees and spanners. In: Handbook of Computational Geometry, pp. 425–461 (2000)Google Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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)zbMATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    Rajaraman, R.: Topology control and routing in ad hoc networks: a survey. SIGACT News 33(2), 60–73 (2002)CrossRefGoogle Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    Tricot, C.: Curves and Fractal Dimension. Springer, Heidelberg (1995)zbMATHGoogle Scholar
  15. 15.
    Volbert, K.: Experimental Analysis of Adjustable Sectorized Topologies for Static Ad Hoc Networks. Accepted for DIALM-POMC (2004)Google Scholar
  16. 16.
    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)Google Scholar
  17. 17.
    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)Google Scholar
  18. 18.
    Yao, A.C.-C.: On Constructing Minimum Spanning Trees in k-dimensional space and related problems. SIAM J. Comput. 11, 721–736 (1982)zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Christian Schindelhauer
    • 1
  • Klaus Volbert
    • 1
  • Martin Ziegler
    • 1
  1. 1.Heinz Nixdorf InstitutePaderborn University, Institute of Computer Science 

Personalised recommendations