Skip to main content

A Fault-Tolerant and Minimum-Energy Path-Preserving Topology Control Algorithm for Wireless Multi-hop Networks

  • Conference paper
Computational Intelligence and Security (CIS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3801))

Included in the following conference series:

Abstract

In this paper, we propose a topology control algorithm for constructing an energy-efficient spanning subgraph for a wireless multi-hop network. The constructed topology has the following properties: (1) it preserves a minimum-energy path between every pair of nodes; (2) it is biconnected, i.e., it can tolerate any one node failure and avoid network partition. Simulation results show that the constructed topology has a small average node degree, a small average transmission range and a constant power stretch factor.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Li, L., Halpern, J.Y.: A minimum-energy path-preserving topology-control algorithm. IEEE Trans. Wireless Communications 3, 910–921 (2004)

    Article  Google Scholar 

  2. Lloyd, E.L., Liu, R., Marathe, M.V., Ramanathan, R., Ravi, S.S.: Algorithmic aspects of topology control problems for ad hoc networks. In: Proc. ACM MOBIHOC, pp. 123–134 (2002)

    Google Scholar 

  3. Hajiaghayi, M., Immorlica, N., Mirrokni, V.S.: Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. In: Proc. ACM MOBIHOC, pp. 300–312 (2003)

    Google Scholar 

  4. Bahramgiri, M., Hajiaghayi, M., Mirrokni, V.S.: Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks. In: Proc. Eleventh International Conference on Computer Communications and Networks (ICCCN), pp. 392–397 (2002)

    Google Scholar 

  5. Li, N., Hou, J.C.: FLSS: A fault-tolerant topology control algorithm for wireless networks. In: Proc. ACM MOBIHOC, pp. 275–286 (2004)

    Google Scholar 

  6. Shen, C.-C., Srisathapornphat, C., Liu, R., Huang, Z., Jaikaeo, C., Lloyd, E.L.: CLTC: a cluster-based topology control framework for ad hoc networks. IEEE Trans. on Mobile Computing 3, 18–32 (2004)

    Article  Google Scholar 

  7. Kazmierczak, A., Radhakrishnan, S.: An optimal distributed ear decomposition algorithm with applications to biconnectivity and outerplanarity testing. IEEE Trans. on Parallel and Distributed systems 11, 110–118 (2000)

    Article  Google Scholar 

  8. Wang, S.-C., Wei, D.S.L., Kuo, S.-Y.: A topology control algorithm for constructing power efficient wireless ad hoc networks. In: IEEE GLOBECOM, pp. 1290–1295 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shen, Z., Chang, Y., Cui, C., Zhang, X. (2005). A Fault-Tolerant and Minimum-Energy Path-Preserving Topology Control Algorithm for Wireless Multi-hop Networks. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596448_128

Download citation

  • DOI: https://doi.org/10.1007/11596448_128

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30818-8

  • Online ISBN: 978-3-540-31599-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics