Skip to main content
SpringerLink
Log in

Performance Optimization Using Multipath Routing in Mobile Ad Hoc and Wireless Sensor Networks

  • Chapter
Combinatorial Optimization in Communication Networks

Part of the book series: Combinatorial Optimization ((COOP,volume 18))

5 Conclusion

Multipath routing has been a promising technique in MANETs and WSNs. It has been shown through both theoretical analysis and simulation results that multipath routing provides many performance benefits, including improved fault tolerance, security, and reliability, improved routing efficiency and reduced routing overhead, more balanced traffic load and energy consumption, reduced end-to-end latency, and aggregated network bandwidth, etc. Significant research efforts have been made and are continuously being made in developing multipath routing protocols and multipath packet forwarding techniques in order to achieve the above-mentioned performance gains effectively and efficiently. Nevertheless, many issues that are directly related to the application of multipath routing remain untouched, such as the integration of the multipath routing into the current single-path routing paradigm, the synchronization of the packets among the multiple paths, and the interfaces of multipath routing protocols to other layers of protocol in the network protocol stack, etc.

Due to space limitations, we are only able to introduce the basic concept of multipath routing, highlight the fundamental techniques used to find the multiple paths, and outline the essential idea of what and why it can help in performance. For detailed algorithms/protocols as well as performance evaluations, interested readers are referred to respective publications.

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

Access this chapter

Log in via an institution
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
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. E. Ayanoglu, I. Chih-Lin, R. D. Gitlin, J. E. Mazo, “Diversity coding for transparent self-healing and fault-tolerant communication networks,” IEEE Transaction on Communications, 41(11):1677–1686, November 1993.

    Article  Google Scholar 

  2. A. F. Akyildiz, W. Su, Y. Sankarasubramainiam, E. Cayirci, “A survey on sensor networks,” IEEE Communications Magazine, August 2002.

    Google Scholar 

  3. A. Banerjea, “On the use of dispersity routing for fault tolerant realtime channels,” European Transactions on Telecommunications, 8(4):393–407, July/August 1997.

    Article  MathSciNet  Google Scholar 

  4. R. Bhandari, Survivable Networks: Algorithms for diverse routing, Kluwer Academic, 1999.

    Google Scholar 

  5. J. Broch, D. Maltz, D. Johnson, Y-C. Hu, J. Jetcheva, “A performance comparison of multi-hop wireless ad hoc network routing protocol,” The 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom’98), pp. 85–97, Dallas, TX, October 1998.

    Google Scholar 

  6. J. Chen, “New Approaches to Routing for Large-Scale Data Networks,” Ph.D Dissertation, Rice University, 1999.

    Google Scholar 

  7. T. Cormen, C. Leiserson, R. Rivest, Introduction to Algorithms, MIT Press, 1990.

    Google Scholar 

  8. H. Chan, A. Perrig, D. Song, “Random key predistribution schemes for sensor networks,” IEEE Symposium on Security and Privacy (SP’03), Oakland, CA, May 2003.

    Google Scholar 

  9. I. Cidon, R. Rom, Y. Shavitt, “Analysis of multi-path routing,” IEEE/ACM Transactions on Networking, 7(6):885–896, December 1999.

    Article  Google Scholar 

  10. J. Chang, L. Tassiulas, “Energy conserving routing in wireless ad hoc networks,” Proceedings INFOCOM 2000, March 2000.

    Google Scholar 

  11. S.K. Das, A. Mukherjee, et al., “An adaptive framework for QoS routing through multiple paths in ad hoc wireless newtorks,” J. Parallel Distributed Computing, 63(2003)141–153.

    Article  MATH  Google Scholar 

  12. S. De, C. Qiao, H. Wu, “Meshed multipath routing: An efficient strategy in sensor networks,” IEEE Wireless Communications and Networking Conference (WCNC’03), New Orleans, LA, March 2003.

    Google Scholar 

  13. D. Ganesan, R. Govindan, S. Shenker, D. Estrin, “Highly-resilient, energy-efficient multipath routing in wireless sensor networks,” Mobile Computing and Communication Review, 5(4):10–24, October 2001.

    Google Scholar 

  14. E. Gustafsson, G. Karlsson, “A literature survey on traffic dispersion,” IEEE Networks, 11(2):28–36, March/April 1997.

    Article  Google Scholar 

  15. N. Gogate, S. S. Panwar, “Supporting video/image applications in a mobile multihop radio environment using route diversity,” IEEE International Conference on Communications (ICC’99), Vancouver, Canada, June 1999.

    Google Scholar 

  16. C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, “Directed diffusion for wireless sensor networks,” IEEE/ACM Transactions on Networking, 11(1):2–16, February 2003.

    Article  Google Scholar 

  17. D. B. Johnson, D. A. Maltz, Y-C. Hu, J. G. Jetcheva, “The dynamic source routing protocol for mobile ad hoc networks,” IETF Internet Draft, draftietf-manet-dsr-06.txt, November 2001.

    Google Scholar 

  18. P. Johansson, T. Larsson, N. Hedman, B. Mielczarek, M. Degermark, “Scenario-based performance analysis of routing protocols for mobile ad hoc networks,” The 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom’99), pp.195–206, Seattle, WA, August 1999.

    Google Scholar 

  19. S. Jain, Yi Lv, S. R. Das, “Exploiting path diversity in the link layer in wireless ad hoc networks,” Technical Report, SUNY at Stony Brook, CS department, WINGS Lab, July 2003.

    Google Scholar 

  20. C. Karlof, D. Wagner, “Secure routing in wireless sensor networks: Attacks and countermeasures,” Elsevier’s AdHoc Networks Journal, Special Issue on Sensor Network Applications and Protocols, 1(2–3):293–315, September 2003.

    Google Scholar 

  21. J. Kong, P. Zerfos, H. Luo, S. Lu, L. Zhang, “Providing robust and ubiquitous security support for MANET,” Proceedings of the 9th IEEE International Conference on Network Protocols(ICNP), pp. 251–260, 2001.

    Google Scholar 

  22. W. Lou, Y. Fang, “A multipath routing approach for secure data delivery,” IEEE Military Communications Conference (MILCOM 2001), Mclean, VA, October 2001.

    Google Scholar 

  23. W. Lou, Y. Fang, “Predictive caching strategy for on-demand routing protocols in ad hoc networks,” Wireless Networks, vol. 8, issue 6, pp. 671–679, November 2002.

    Article  MATH  Google Scholar 

  24. W. Lou, W. Liu, Y. Fang, “SPREAD: Enhancing data confidentiality mobile ad hoc networks,” IEEE INFOCOM 2004, Hong Kong, March 2004.

    Google Scholar 

  25. W. Liu, Y. Zhang, W. Lou, Y. Fang, “Scalable and robust data dissemination in wireless sensor networks,” IEEE GLOBECOM 2004, Dallas, TX, December 2004.

    Google Scholar 

  26. W. Lou, “An efficient N-to-1 multipath routing protocol in wireless sensor networks,” 2nd IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS 2005), Washington DC, November 2005.

    Google Scholar 

  27. S.-J. Lee, M. Gerla, “AODV-BR: backup routing in ad hoc networks,” IEEE Wireless Communications and Networking Conference (WCNC’00), September 2000.

    Google Scholar 

  28. S.-J. Lee, M. Gerla, “Split multipath routing with maximally disjoint paths in ad hoc networks”, International Conference on Communications (ICC’01), Helsinki, Finland, June 2001.

    Google Scholar 

  29. N. F. Maxemchuk, “Dispersity routing,” International Conference on Communications (ICC’ 75), pp. 41.10–41.13, San Francisco, Ca, June 1975.

    Google Scholar 

  30. N. F. Maxemchuk, “Dispersity routing in high speed networks,” Computer Networks and ISDN Systems, 25(6):645–661, 1993.

    Article  Google Scholar 

  31. N. F. Maxemchuk, “Dispersity routing on ATM networks,” IEEE INFOCOM’93, vol. 1, pp. 347–57, San Francisco, CA, Mar 1993.

    Google Scholar 

  32. M. K. Marina, S. R. Das, “On-demand multipath distance vector routing in ad hoc networks,” 9th International Conference on Network Protocols, Riverside, CA, November, 2001.

    Google Scholar 

  33. A. Nasipuri, R. Castaneda, S. R. Das, “Performance of multipath routing for on-demand protocols in mobile ad hoc networks,” Mobile Networks and Applications, 6(4):339–349, 2001.

    Article  MATH  Google Scholar 

  34. V. D. Park, M. S. Corson, “A highly adaptive distributed routing algorithm for mobile wireless networks,” IEEE INFOCOM’97, pp. 1405–1413, Kobe, Japan, April 1997.

    Google Scholar 

  35. M. R. Pearlman, Z. J. Haas, “Improving the performance of query-based routing protocols through diversity injection,” IEEE Wireless Communications and Networking Conference (WCNC’99), New Orleans, LA, September 1999.

    Google Scholar 

  36. M.R. Pearlman, Z.J. Haas, P. Sholander, S.S. Tabrizi, “On the impact of alternate path routing for load balancing in mobile ad hoc networks,” The ACM Symposium on Mobile Ad Hoc Networking and Computing (Mobi-HOC’00), Boston, MA, August 2000.

    Google Scholar 

  37. P. Papadimitratos, Z.J. Haas, E. G. Sirer, “Path set selection in mobile ad hoc networks,” The ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc’2002), EPFL Lausanne, Switzerland, June 2002.

    Google Scholar 

  38. E. M. Royer, C-K Toh, “A review of current routing protocols for ad hoc mobile wireless networks,” IEEE Personal Communications, 6(2):46–55, April 1999.

    Article  Google Scholar 

  39. D. Sidhu, S. Abdallah, R. Nair, “Congestion control in high speed networks via alternative path routing,” Journal of High Speed Networks, 2(2):129–144, 1992.

    Google Scholar 

  40. N. Taft-Plotkin, B. Bellur, R. Ogier, “Quality-of-Service Routing Using Maximally Disjoint Paths,” 1999 Seventh International Workshop on Quality of Service, London, UK, June 1999.

    Google Scholar 

  41. A. Tsirigos, Z. J. Haas, “Multipath routing in the presence of frequent topological changes,” IEEE Communication Magazine, 39(11):132–138, November 2001.

    Article  Google Scholar 

  42. A. Shamir, “How to share a secret,” Communications of the ACM, 22(11):612–613, November 1979.

    Article  MATH  MathSciNet  Google Scholar 

  43. G. J. Simmons, “An introduction to shared secret and/or shared control schemes and the application,” Contemporary Cryptology: The Science of Information Integrity, IEEE Press, pp. 441–497, 1992.

    Google Scholar 

  44. S. Singh, M. Woo, C.S. Raghavendra, “Power aware routing in mobile ad hoc networks,” Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom’ 98), 1998.

    Google Scholar 

  45. K. Wu, J. Harms, “Performance study of a multipath routing method for wireless mobile ad hoc networks,” 9th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication System (MASCOTS’01), Cincinnati, Ohio, August 2001.

    Google Scholar 

  46. Z. Ye, S. V. Krishnamurthy, S. K. Tripathi, “A framework for reliable routing in mobile ad hoc networks,” IEEE INFOCOM 2003, San Francisco, CA, March 2003.

    Google Scholar 

  47. J. Yang, S. Papavassiliou, “Improving network security by multipath traffic dispersion,” IEEE Military Communications Conference (Milcom’01), McLean, VA, October 2001.

    Google Scholar 

  48. L. Zhou, Z. J. Haas, “Securing ad hoc networks,” IEEE Network Magazine, 13(6):24–30, November/December 1999.

    Article  Google Scholar 

  49. S. Zhu, S. Xu, S. Setia, S. Jajodia, “Establishing pairwise keys for secure communication in ad hoc networks: A probabilistic approach,” 11th IEEE International Conference on Network Protocols (ICNP’03), Atlanta, GA, November 2003.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Worcester Polytechnic Institute, Worcester, MA, 01609

    Wenjing Lou

  2. Department of Electrical and Computer Engineering, University of Florida, Gainesville, FL, 32611

    Wei Liu & Yanchao Zhang

Authors
  1. Wenjing Lou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wei Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yanchao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Missouri, Rolla, Missouri

    Maggie Xiaoyan Cheng

  2. Georgia State University, Atlanta, Georgia

    Yingshu Li

  3. University of Texas at Dallas, Richardson, Texas

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Lou, W., Liu, W., Zhang, Y. (2006). Performance Optimization Using Multipath Routing in Mobile Ad Hoc and Wireless Sensor Networks. In: Cheng, M.X., Li, Y., Du, DZ. (eds) Combinatorial Optimization in Communication Networks. Combinatorial Optimization, vol 18. Springer, Boston, MA. https://doi.org/10.1007/0-387-29026-5_5

Download citation

  • DOI: https://doi.org/10.1007/0-387-29026-5_5

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-29025-6

  • Online ISBN: 978-0-387-29026-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation