Wireless Networking: Graph Theory Unplugged | SpringerLink
Skip to main content
Springer Nature Link
Log in

Wireless Networking: Graph Theory Unplugged

  • Conference paper
Graph-Theoretic Concepts in Computer Science (WG 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3353))

Included in the following conference series:

Abstract

Wireless and mobile networks are an excellent playground for graph theoreticians. Many research challenges turn out to be variants of classic graph theory problems. In particular the rapidly growing areas of ad-hoc and sensor networks demand new solutions for timeless graph theory problems, because i) wireless devices have lower bandwidth and ii) wireless devices are mobile and therefore the topology of the network changes rather frequently. As a consequence, algorithms for wireless and mobile networks should have i) as little communication as possible and should ii) run as fast as possible. Both goals can only be achieved by developing algorithms requiring a small number of communication rounds only (so-called local algorithms). In this work we present a few connections between graph theory and wireless networking, such as topology control, clustering, and geo-routing. Each section is supplemented with an open problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Abraham, I., Dolev, D., Malkhi, D.: LLS: A Locality Aware Location Service for Mobile Ad Hoc Networks. In: Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M) (2004)

    Google Scholar 

  2. Alzoubi, K., Wan, P.-J., Frieder, O.: Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks. In: Proc. ACM Int. Symposium on Mobile ad hoc networking & computing (MobiHoc), EPFL Lausanne, Switzerland, pp. 157–164 (2002)

    Google Scholar 

  3. Awerbuch, B., Peleg, D.: Concurrent online tracking of mobile users. In: SIGCOMM, pp. 221–233 (1991)

    Google Scholar 

  4. Beutel, J.: Geolocation in a Picoradio Environment. Master Thesis, ETH Zurich and UC Berkeley (1999)

    Google Scholar 

  5. Beutel, J., Kasten, O., Ringwald, M.: BTnodes – A Distributed Platform for Sensor Nodes. In: Prof. of the ACM Conference on Embedded Networked Sensor Systems (SenSys) (2003)

    Google Scholar 

  6. Bischoff, R., Wattenhofer, R.: Analyzing Connectivity-Based Multi-Hop Ad- Hoc Positioning. In: Proc. of the Second Annual IEEE International Conference on Pervasive Computing and Communications (PerCom) (2004)

    Google Scholar 

  7. Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with Guaranteed Delivery in ad hoc Wireless Networks. In: Proc. of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M), pp. 48–55 (1999)

    Google Scholar 

  8. Breu, H., Kirkpatrick, D.G.: Unit Disk Graph Recognition is NP-hard. Comput. Geom. Theory Appl. 9(1-2), 3–24 (1998)

    MATH  MathSciNet  Google Scholar 

  9. Burkhart, M., von Rickenbach, P., Wattenhofer, R., Zollinger, A.: Does topology control reduce interference? In: Proc. ACM Int. Symposium on Mobile ad hoc networking & computing (MobiHoc) (2004)

    Google Scholar 

  10. Busch, C., Surapaneni, S., Tirthapura, S.: Analysis of Link Reversal Routing Algorithms for Mobile Ad Hoc Networks. In: 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (2003)

    Google Scholar 

  11. Blough, D.M., Leoncini, M., Resta, G., Santi, P.: The k-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks. In: Proc. ACM Int. Symposium on Mobile ad hoc networking & computing (MobiHoc) (2003)

    Google Scholar 

  12. Feige, U.: A Threshold of ln n for Approximating Set Cover. Journal of the ACM (JACM) 45(4), 634–652 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  13. Fussen, M., Wattenhofer, R., Zollinger, A.: On Interference Reduction in Sensor Networks. Technical Report 453, Department of Computer Science, ETH Zurich (2004)

    Google Scholar 

  14. Gafni, E.M., Bertsekas, D.P.: Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Transactions on Communication 29 (1981)

    Google Scholar 

  15. Gao, J., Guibas, L., Hershberger, J., Zhang, L., Zhu, A.: Discrete Mobile Centers. In: Proc. 17 th Annual Symposium on Computational Geometry (SCG), pp. 188–196. ACM Press, New York (2001)

    Google Scholar 

  16. Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D.E., Pister, K.S.J.: System architecture directions for networked sensors. In: Architectural Support for Programming Languages and Operating Systems (ASPLOS), pp. 93–104 (2000)

    Google Scholar 

  17. Jia, L., Rajaraman, R., Scheideler, C.: On Local Algorithms for Topology Control and Routing in Ad Hoc Networks. In: Proc. of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA) (2003)

    Google Scholar 

  18. Jia, L., Rajaraman, R., Suel, R.: An Efficient Distributed Algorithm for Constructing Small Dominating Sets. In: Proc. of the 20th ACM Symposium on Principles of Distributed Computing (PODC), pp. 33–42 (2001)

    Google Scholar 

  19. Kawadia, V., Kumar, P.R.: Power control and clustering in ad hoc networks. In: Proc. of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) (2003)

    Google Scholar 

  20. Kranakis, E., Singh, H., Urrutia, J.: Compass Routing on Geometric Networks. In: Proc. 11th Canadian Conference on Computational Geometry (CCCG), Vancouver, August 1999, pp. 51–54 (1999)

    Google Scholar 

  21. Kuhn, F., Moscibroda, T., Wattenhofer, R.: Initializing Newly Deployed Ad Hoc and Sensor Networks. In: Proceedings of the 10th Annual International Conference on Mobile Computing and Networking (MobiCom) (2004)

    Google Scholar 

  22. Kuhn, F., Moscibroda, T., Wattenhofer, R.: Unit Disk Graph Approximation. In: Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M) (2004)

    Google Scholar 

  23. Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally! In: Proc. of the 23rd ACM Symposium on Principles of Distributed Computing (PODC) (2004)

    Google Scholar 

  24. Kuhn, F., Wattenhofer, R.: Constant-Time Distributed Dominating Set Approximation. In: Proc. of the 22nd ACM Symposium on the Principles of Distributed Computing (PODC) (2003)

    Google Scholar 

  25. Kuhn, F., Wattenhofer, R.: Distributed Combinatorial Optimization. Technical Report 426, Department of Computer Science, ETH Zurich (2003)

    Google Scholar 

  26. Kuhn, F., Wattenhofer, R., Zhang, Y., Zollinger, A.: Geometric Routing: Of Theory and Practice. In: Proc. of the 22 nd ACM Symposium on the Principles of Distributed Computing (PODC) (2003)

    Google Scholar 

  27. Kuhn, F., Wattenhofer, R., Zollinger, A.: Asymptotically optimal geometric mobile ad-hoc routing. In: Proc. of the International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M), Atlanta, Georgia, USA (September 2002)

    Google Scholar 

  28. Kuhn, F., Wattenhofer, R., Zollinger, A.: Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing. In: Proc. ACM Int. Symposium on Mobile ad hoc networking & computing (MobiHoc) (2003)

    Google Scholar 

  29. Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., Grunewald, M.: Energy, congestion and dilation in radio networks. In: Proc. of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA (2002)

    Google Scholar 

  30. Moscibroda, T., O’Dell, R., Wattenhofer, M., Wattenhofer, R.: Virtual Coordinates for Ad hoc and Sensor Networks. In: Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M) (2004)

    Google Scholar 

  31. Navas, J.C., Imielinski, T.: GeoCast – Geographic Addressing and Routing. In: Proceedings of the Annual International Conference on Mobile Computing and Networking (MobiCom), pp. 66–76 (1997)

    Google Scholar 

  32. Prakash, R.: Unidirectional Links Prove Costly in Wireless Ad-Hoc Networks. In: Proc. of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M) (1999)

    Google Scholar 

  33. Rao, A., Papadimitriou, C., Ratnasamy, S., Shenker, S., Stoica, I.: Geographic Routing without Location Information. In: Proceedings of the 10th Annual International Conference on Mobile Computing and Networking (MobiCom) (2003)

    Google Scholar 

  34. Schiller, J., et al.: The scatterweb project: See for more details, http://www.scatterweb.net

  35. Wang, Y., Li, X.-Y.: Localized Construction of Bounded Degree Planar Spanner. In: Proc. of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing (2003)

    Google Scholar 

  36. Wattenhofer, R., Li, L., Bahl, P., Wang, Y.-M.: Distributed Topology Control for Power Efficient Operation in Multihop Wireless Ad Hoc Networks. In: Proc. of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) (2001)

    Google Scholar 

  37. Wattenhofer, R., Zollinger, A.: XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks. In: Proceedings of 4th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN) (2004)

    Google Scholar 

  38. Xue, Y., Li, B., Nahrstedt, K.: A scalable location management scheme in mobile ad-hoc networks. In: IEEE LCN (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ETH Zurich, 8092, Zurich, Switzerland

    Roger Wattenhofer

Authors
  1. Roger Wattenhofer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, ETH Zurich, ETH Zentrum, CH-8022, Zurich, Switzerland

    Juraj Hromkovič

  2. Department of Computer Science, RWTH Aachen, Chair of Computer Science III, Aachen, Germany

    Manfred Nagl

  3. Department of Computer Science III, RWTH Aachen University, Ahornstra{ß}e 55, 52074, Aachen, Germany

    Bernhard Westfechtel

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wattenhofer, R. (2004). Wireless Networking: Graph Theory Unplugged. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2004. Lecture Notes in Computer Science, vol 3353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30559-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30559-0_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24132-4

  • Online ISBN: 978-3-540-30559-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation