Skip to main content

Design and Analysis of a k-Connected Topology Control Algorithm for Ad Hoc Networks

  • Conference paper
Parallel and Distributed Processing and Applications (ISPA 2004)

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

Abstract

Topology control is an effective approach to reduce the energy consumption in wireless ad hoc networks. In this paper, we propose a k-connected (KC) energy saving topology control algorithm, which is fully distributed, asynchronous and scalable with little overhead. We prove KC algorithm has several valuable properties. First, it is optimal for the local energy-saving topology control; second it preserves the network connectivity (even k-connectivity if the neighbor topology is k-connected) and dramatically reduces the energy consumption; third, each node degree obtained by the KC algorithm cannot exceed 6*k. Performance simulation shows the effectiveness of our proposed algorithm.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • 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.

References

  1. Ramanathan, R., Rosales-Hain, R.: Topology control of multihop wireless networks using transmit power adjustment. In: Proc. IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000, pp. 404–413 (2000)

    Google Scholar 

  2. Li, L., Halpern, J.Y., Bahl, P., Wang, Y.-M., Wattenhofer, R.: Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks. In: Proc. ACM Symposium on Principles of Distributed Computing, Newport, Rhode Island, United States, August 2001, pp. 264–273 (2001)

    Google Scholar 

  3. Blough, D.M., Leoncini, M., Resta, G., Santi, P.: The k-Neighbors Approach to Symmetric Topology Control in Ad Hoc Networks. submitted to IEEE J. on Selected Areas in Communications

    Google Scholar 

  4. Tseng, Y.-C., Chang, Y.-N., Tzeng, B.-H.: Energy-efficient topology control for wireless ad hoc sensor networks. In: Proc. Int. Conf. Parallel and Distributed Systems, ICPADS 2002 (2002)

    Google Scholar 

  5. Li, N., Hou, J.C., Sha, L.: Design and analysis of an MSTbased topology control algorithm. In: Proc. IEEE INFOCOM 2003, San Francisco, CA, USA (April 2003)

    Google Scholar 

  6. Wan, P., Calinescu, A., Li, X., Frieder, O.: Minimum energy broadcast routing in static ad hoc wireless networks. In: Proc. Of IEEE INFOCOM (2001)

    Google Scholar 

  7. Narayanaswamy, S., Kawadia, V., Sreenivas, R.S., Kumar, P.R.: Power control in ad-hoc networks: Theory, architecture, algorithm and implementation of the compow protocol. In: Proc. of European Wireless 2002, Florence, Italy, February 2002, pp. 156–162 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, L., Wang, X., Dou, W. (2004). Design and Analysis of a k-Connected Topology Control Algorithm for Ad Hoc Networks. In: Cao, J., Yang, L.T., Guo, M., Lau, F. (eds) Parallel and Distributed Processing and Applications. ISPA 2004. Lecture Notes in Computer Science, vol 3358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30566-8_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30566-8_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24128-7

  • Online ISBN: 978-3-540-30566-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics