Skip to main content

Advertisement

Log in

A framework for self-healing and optimizing routing techniques for mobile ad hoc networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

On demand routing protocols provide scalable and cost-effective solutions for packet routing in mobile wireless ad hoc networks. The paths generated by these protocols may deviate far from the optimal because of the lack of knowledge about the global topology and the mobility of nodes. Routing optimality affects network performance and energy consumption, especially when the load is high. In this paper, we define routing optimality using different metrics such as path length, energy consumption along the path, and energy aware load balancing among the nodes. We then propose a framework of Self-Healing and Optimizing Routing Techniques (SHORT) for mobile ad hoc networks. While using SHORT, all the neighboring nodes monitor the route and try to optimize it if and when a better local subpath is available. Thus SHORT enhances performance in terms of bandwidth and latency without incurring any significant additional cost. In addition, SHORT can be also used to determine paths that result in low energy consumption or to optimize the residual battery power. Thus, we have detailed two broad classes of SHORT algorithms: Path-Aware SHORT and Energy-Aware SHORT. Finally, we evaluate SHORT using the ns-2 simulator. The results demonstrate that the performance of existing routing schemes can be significantly improved using the proposed SHORT algorithms.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. S. Banerjee and A. Misra, “Minimum energy paths for reliable communication in multi-hop wireless networks,” in: Proceedings of ACM International Conference on Mobile Computing and Networking (MOBIHOC) (2002).

  2. T.X. Brown, H.N. Gabow and Q. Zhang, “Maximum flow-life curve for a wireless ad hoc network,” in: Proceedings of ACM International Conference on Mobile Computing and Networking (MOBIHOC) (2001).

  3. J. Broch, D.A. Maltz, D.B. Johnson, Y.-C. Hu and J. Jetcheva, “A performance comparison of multi-hop wireless ad hoc network routing protocols,” in: ACM International Conference on Mobile Computing and Networking (MOBICOM) (1998).

  4. J. Broch, D.B. Johnson and D.A. Maltz, “The dynamic source routing protocol for mobile ad hoc networks,” IETF Internet draft, draft-ietf-manet-dsr-01.txt (Dec. 1998) (work in progress.)

  5. T. Camp, J. Boleng and V. Davies, “A survey of mobility models for ad hoc network research,” Wireless Communication & Mobile Computing (WCMC): Special issue on Mobile Ad Hoc Networking: Research, Trends and Applications, Vol. 2, No. 5 (2002) pp. 483–502.

  6. R. Castaneda and S.R. Das, “Query localization techniques for on-demand routing protocols in ad hoc networks,” in: Proc. ACM International Conference on Mobile Computing and Networking (MOBICOM) (1999).

  7. S. Chen and K. Nahrstedt, “Distributed quality-of-service routing in ad-hoc networks,” in: IEEE Journal of Selected Areas on Communications, Vol. 17, No. 8 (Aug. 1999).

  8. D. De Couto, D. Aguayo, B.A. Chambers and R. Morris, “Performance of multihop wireless networks: shortest path is not enough,” in: Proceedings of HOTNET (2002).

  9. R. Dube, C.D. Rais, K.-Y. Wang and S.K. Tripathi, “Signal stability based adaptive routing (SSA) for ad-hoc mobile networks,” in: IEEE Personal Communications (Feb. 1997) pp. 36–45.

  10. K. Fall and K. Varadhan (Eds.), ns notes and documentation (2002) available from http://www-mash.cs.berkeley.edu/ns/.

  11. D. Ganesan, R. Govindan, S. Shenker and D. Estrin, “Highly-resilient, energy-efficient multipath routing in wireless sensor networks,” in: Proc. ACM International Symposium on Mobile Ad Hoc Networking & Computing (MOBIHOC) (2001).

  12. J. Gomez and A. Campbell, “Power-aware routing optimization for wireless ad hoc networks,” in: Proceedings of High Speed Networks Workshop (HSN) (June, 2001).

  13. J. Gomez, A.T. Campbell, M. Naghshineh and C. Bisdikian, “PARO: a power-aware routing optimization scheme for mobile ad hoc networks,” draft-gomez-paro-manet-00.txt, work in progress, IETF (March 2001).

  14. Y.-C. Hu and D.B. Johnson, “Caching strategies in on-demand routing protocols for wireless ad hoc networks,” in: Proc. ACM International Conference on Mobile Computing and Network (MOBICOM) (2000).

  15. A. Iwata, C.C. Chiang, G. Pei, M. Gerla and T. Chen, “Scalable routing Strategies for ad hoc wireless networks,” in: IEEE Journal of Selected Areas on Communications, Vol. 17, No. 8 (Aug. 1999).

  16. D.B. Johnson and D.A. Maltz, “Dynamic source routing in ad-hoc wireless networks,” Mobile Computing, T. Imielinski and H. Korth, Eds., Kluwer (1996) pp. 153–81.

  17. S.J. Lee, Routing and Multicasting Strategies in Wireless Mobile Ad Hoc Networks, Ph.D. Thesis, Computer Science Department, UCLA (2000).

  18. S.J. Lee and M. Gerla, “AODV-BR: backup routing in ad hoc networks,” in: Proc. IEEE WCNC 2000, Chicago, IL (Sept. 2000).

  19. Jinyang Li, Charles Blake, Douglas S.J. De Couto and Hu Imm Lee and Robert Morris, “Capacity of ad hoc wireless networks,” in: Proceedings of ACM International Conference on Mobile Computing and Networking (MOBIHOC) (2001).

  20. V. Park and S. Corson, “A highly adaptive distributed routing algorithm for mobile wireless networks,” Proc. IEEE INFOCOM ’97, Vol. 3, pp. 1405–13.

  21. C.E. Perkins and P. Bhagwat, “‘Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers,” in: Comp. Commun. Rev. (Oct. 1994) pp. 234–44.

  22. C.E. Perkins and E.M. Royer, “Ad-hoc on-demand distance vector routing,” in: Proc. IEEE Workshop on Mobile Computing Systems and Applications (Feb. 1999) pp. 90–100.

  23. C.E. Perkins, E.M. Royer and S.R. Das, “Ad-hoc on demand distance vector (AODV) routing,” Internet Draft, draft-ietf-manet-aodv-05.txt (March 2000) work in progress.

  24. E.M. Royer and C.-K. Toh, “‘A review of current routing protocols for ad hoc mobile wireless networks,” in: IEEE Personal Communications (April 1999).

  25. C.A. Santivanez, R. Ramanathan and I. Stavrakakis, “Making link-state routing scale for ad hoc networks,” in: Proc. ACM International Symposium on Mobile Ad Hoc Networking & Computing (MOBIHOC) (2001).

  26. C.A. Santivanez, B. McDonald, I. Stavrakakis and R. Ramanathan, “On the scalability of ad hoc routing protocols,” in: Proc. IEEE INFOCOM 2002, New York, NY (June 2002).

  27. S. Singh, M. Woo and C.S. Raghavendra, “Power-aware routing in mobile ad hoc networks,” in: ACM International Conference on Mobile Computing and Networking (MOBICOM) (1999).

  28. M. Spohn and J.J. Garcia-Luna-Aceves, “Neighborhood aware source routing,” in: Proc. ACM International Symposium on Mobile Ad Hoc Networking & Computing (MOBIHOC) (2001).

  29. I. Stojmenovic and X. Lin, “Power-aaware localized routing in wireless networks,” in: IEEE Transactions on Parallel and Distributed Systems, Vol. 12, No. 10 (Oct. 2001).

  30. W. Su, S.-J. Lee and M. Gerla, “Mobility prediction in wireless networks,” in: Proc. IEEE MILCOM 2000 CA (Oct. 2000).

  31. C.-K. Toh, “A novel distributed routing protocol to support ad-hoc mobile computing,” in: IEEE 15th Annual International Phoenix Conf. Comp. and Commun. (March 1996) pp. 480–86.

  32. J.E. Wieselthier, G.D. Nguyen and A. Ephremides, “Energy-aware wireless networking with directional antennas: the case of session-based broadcasting and multicasting,” in: IEEE Trans. on Mobile Computing, Vol. 1, No. 3 (July–Sept. 2002) pp. 176–191.

  33. Virtual InterNetwork Testbed (VINT), http://www.isi.edu/nsnam/vint

  34. Mobile Networking Architectures (Monarch), http://www.monarch.cs.rice.edu

  35. Z. Ye, S.V. Krishnamurthy and S.K. Tripathi, “A framework for reliable routing in mobile ad hoc networks,” IEEE INFOCOM (2003).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chao Gui.

Additional information

This research was supported in part by the National Science Foundation under the grants CCR-0296070 and ANI-0296034, and a generous gift from the Hewlett Packard Corporation. A preliminary version of this paper appeared in the proceedings of the ACM MobiHoc 2003.

Chao Gui is a Technical Research Staff at Kiyon Inc (www.kiyon.com). His research interests include wireless networking and mobile computing. His current efforts are on industrial implementation of wireless mesh networks and embedded systems. Dr. Gui has received Ph.D. in Computer Science from University of California at Davis in 2005.

Dr. Prasant Mohapatra is currently a Professor in the Department of Computer Science at the University of California, Davis. He has also held various positions at Iowa State University, Michigan State University, Intel Corporation, Panasonic Technologies, Institute of Infocomm Research, Singapore, and the National ICT, Australia. Dr. Mohapatra received his Ph.D. in Computer Engineering from the Pennsylvania State University in 1993. He was/is on the editorial boards of the IEEE Transactions on computers, ACM/Springer WINET, and Ad hoc Networks Journal. He has served on numerous technical program committees for international conferences, and served on several panels. He was the Program Vice-Chair of INFOCOM 2004, and the Program Co-Chair of the First IEEE International Conference on Sensor and Ad Hoc Communications and Networks, (SECON-2004). Dr. Mohapatra’s research interests are in the areas of wireless networks, sensor networks, Internet protocols and QoS.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gui, C., Mohapatra, P. A framework for self-healing and optimizing routing techniques for mobile ad hoc networks. Wireless Netw 14, 29–46 (2008). https://doi.org/10.1007/s11276-006-7591-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-006-7591-1

Keywords

Navigation