Skip to main content

Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks

  • Conference paper
Book cover Combinatorial Optimization and Applications (COCOA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5573))

Abstract

This paper addresses the problem of fault-tolerant many-to-one routing in static wireless networks with asymmetric links, which is important in both theoretical and practical aspects. The problem is to find a minimum energy subgraph for a given subset and a destination node such that there are k node-disjoint paths from each node in the subset to the destination node in the subgraph. We prove that the problem is NP-hard, and propose two efficient heuristic approaches, namely, the minimum weight k node-disjoint paths based (MWkNDPB) approach and the minimum energy k node-disjoint paths based (MEkNDPB) approach. Extensive simulations have been conducted to show that proposed algorithms are efficient.

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 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.00
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. Bahramgiri, M., Hajiaghayi, M., Mirrokni, V.: Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-Hop Networks. In: Proc. 11th IEEE Int’l Conf. Computer Comm. and Networks (2002)

    Google Scholar 

  2. Calinescu, G., Wan, P.: Range Assignment for High Connectivity in Wireless Ad Hoc Networks. In: Proc. Second Int’l Conf. Ad-Hoc Networks and Wireless (2003)

    Google Scholar 

  3. Hajiaghayi, M., Immorlica, N., Mirrokni, V.: Power Optimization in Fault-Tolerant Topology Control Algorithms for Wireless Multi-Hop Networks. In: Proc. ACM MobiCom (2003)

    Google Scholar 

  4. Jia, X., Kim, D., Wan, P., Yi, C.: Power Assignment for k-connectivity in Wireless Ad Hoc Networks. In: Proc. IEEE INFOCOM (2005)

    Google Scholar 

  5. Khuller, S., Raghavachari, B.: Improved Approximation Algorithms for Uniform Connectivity Problems. In: Proc. 27th Ann. ACM Symp. Theory of Computing (1995)

    Google Scholar 

  6. Li, L., Halpern, J., Bahl, P., Wang, Y., Wattenhofer, R.: Analysis of a Cone-Based Distributed Topology Control Algorithm for Wireless Multi-Hop Networks. In: Proc. 20th Ann. ACM Symp. Principles of Distributed Computing (2001)

    Google Scholar 

  7. Li, N., Hou, J.C.: FLSS: A Fault-Tolerant Topology Control Algorithm for Wireless Networks. In: Proc. ACM MobiCom (2004)

    Google Scholar 

  8. Li, D., Jia, X., Liu, H.: Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks. IEEE Transcations on Mobile Computing 3(2), 144–151 (2004)

    Article  Google Scholar 

  9. Li, D., Liu, Q., Hu, X., Jia, X.: Energy efficient multicast routing in ad hoc wireless networks. Computer Communications 30(18), 3746–3756 (2007)

    Article  Google Scholar 

  10. Lloyd, E.L., Liu, R., Marathe, M.V., Ramanathan, R., Ravi, S.: Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks. In: Proc. ACM MobiHoc (2002)

    Google Scholar 

  11. Lloyd, E.L., Liu, R., Marathe, M.V., Ramanathan, R., Ravi, S.: Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks. Mobile Network Application 1-2(10), 19–34 (2005)

    Article  Google Scholar 

  12. Ramanathan, R., Hain, R.: Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment. In: Proc. IEEE INFOCOM (2000)

    Google Scholar 

  13. Srinivas, A., Modiano, E.: Minimum Energy Disjoint Path Routing in Wireless Ad-Hoc Networks. In: Proc. ACM MobiCom (2003)

    Google Scholar 

  14. Suurballe, J.W.: Disjoint Paths in a Network. Networks 4(2), 125–145 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  15. Wang, F., Hai, T., Li, Y., Cheng, X., Du, D.: Fault-Tolerance Topology Control for All-to-One and One-to-All Communication in Wireless Networks. IEEE Transaction on Mobile Computing 3(7), 322–331 (2008)

    Article  Google Scholar 

  16. Wattenhofer, R., Li, L., Bahl, P., Wang, Y.: Distributed Topology Control for Wireless Multihop Ad-Hoc Networks. In: Proc. IEEE INFOCOM (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, D., Zhu, Q., Yang, H. (2009). Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks. In: Du, DZ., Hu, X., Pardalos, P.M. (eds) Combinatorial Optimization and Applications. COCOA 2009. Lecture Notes in Computer Science, vol 5573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02026-1_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02026-1_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02025-4

  • Online ISBN: 978-3-642-02026-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics