[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

A highly topology adaptable ad hoc routing protocol with complementary preemptive link breaking avoidance and path shortening mechanisms

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Ad-hoc on-demand distance vector routing (AODV) is a well-known routing protocol for mobile ad hoc networks. The original AODV protocol works in a semi-dynamic fashion, by establishing a route on demand and using that route until it breaks. However, to suit the changing network topology of ad hoc networks, more aggressive and adaptable routing strategies are required. A number of researches have proposed improving AODV performance by locally repairing broken links, predicting and replacing potentially vulnerable links, or shortening a link through removing redundant nodes from the transmission path. Although local repair may relieve some problems, it usually results in longer paths and thus a considerable performance drop in heavy traffic conditions. There are also issues regarding packet loss and communication delay due to route rebuilding once the link is broken. Predicting and replacing potentially vulnerable links may require special hardware, additional tables to maintain, or other extra overhead. Finally, path shortening may result in shorter and more efficient routes, but there is no guarantee that the new paths will be robust. This paper proposes integrating preemptive link breaking avoidance and path shortening mechanisms into a modified AODV protocol. However, the difficult issue lies in determining the right timing to initiate the two independent mechanisms so that the two dynamically and complementarily operating mechanisms can work together to improve the routing performance. Through numerical analysis and simulation, we have arranged a simple parameter setting for controlling the activation of each mechanism at the appropriate time. The proposed combination is a highly dynamic ad hoc routing protocol that is capable of adapting itself to the changing network topology and achieving extremely good performance in various routing performance metrics. Extensive simulations show that each of the two schemes alone improves AODV performance. More importantly, the integrated protocol performs even better in terms of data delivery rate, average delay time, and network overhead. To be more specific, in the best cases our protocol can reduce up to 82% in control overhead and 66% in delay time, while achieving 12% more in data delivery rate comparing to AODV.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18

Similar content being viewed by others

References

  1. Perkins, C. E., & Royer, E. M. (1999.) Ad-hoc on-demand distance vector routing. In Proceedings of the Second IEEE Workshop on Mobile Computing Systems and Applications (pp. 90–100).

  2. Johnson, D. B., & Maltz, D. A. (1996). Dynamic source routing in ad-hoc wireless networks. Mobile Computing, 15, 3–181.

    Google Scholar 

  3. Johnson, D. B., Maltz, D. A., & Hu, Y. C. (2002). The dynamic source routing protocol for mobile ad hoc networks (DSR). In IETF Internet-Draft, draft-ietf-manet-dsr-10.txt.

  4. Corson, M. S., & Park, V. D. (1997). Temporally ordered routing algorithm (TORA) version 1: Functional specification. In Internet-Draft, draft-ietf-manet-tora-spec- 00.txt.

  5. Perkins, C. E., & Bhagwat, P. (1994). Highly dynamic destination sequenced distance vector routing (DSDV) for mobile computers. In ACM SIGCOMM’94 Conference on Communications Architectures, Protocols and Applications (pp. 234–244).

  6. Royer, E. M., & Chai-Keong, T. (1999). A review of current routing protocols for ad hoc mobile wireless networks. IEEE Personal Communications, 6, 46–55.

    Article  Google Scholar 

  7. Broch, J., Johnson, D. B., Maltz, D. A., Hu, Y.-C., & Jetcheva, J. (1998). A performance comparison of multi-hop wireless ad-hoc network routing protocols. In ACM/IEEE International Conference on Mobile Computing and Networking (October, pp. 85–97).

  8. Das, S. R., Perkins, C. E., & Royer, E. M. (2000). Performance comparison of two on-demand routing protocols for ad hoc networks. In Proceedings of the Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (pp. 3–12).

  9. Saito, M., Aida, H., Tobe, Y., & Tokuda, H. (2004). A proximity-based dynamic path shortening scheme for ubiquitous ad hoc networks. In Proceedings of the 24th International Conference on Distributed Computing Systems (pp. 390–397).

  10. Gui, C., & Mohapatra, P. (2003). SHORT: Self-healing and optimizing routing techniques for mobile ad hoc networks. In Proceedings of the 4th ACM International Symposium on Mobile ad hoc Networking and Computing (pp. 279–290).

  11. Roy, S., & Garcia-Luna-Aceves, J. J. (2001). Using minimal source trees for on-demand routing in ad hoc networks. In Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (pp. 1172–1181).

  12. Crisostomo, S., Sargento, S., Brandao, P., & Prior, R. (2004). Improving AODV with preemptive local route repair. In IEEE International Workshop on Wireless Ad-Hoc Networks (pp. 223–227).

  13. Srinath, P., Abhilash, P., & Sridhar, I. (2002). Router handoff: A preemptive route repair strategy for AODV. In IEEE International Conference on Personal Wireless Communications (pp. 168–171).

  14. Lee, S.-J., & Gerla, M. (2000). AODV-BR: Backup routing in ad hoc networks. In IEEE Wireless Communications and Networking Conference (WCNC) (September, pp. 23–28).

  15. Chung, C. M., Wang, Y. H., & Chuang, C. C. (2001). Ad hoc on-demand backup node setup routing protocol. In Proceedings of 15th IEEE International Conference on Information Networking (pp. 933–937).

  16. Agarwal, A., & Jain, B. (2004). QoS-based on-demand segmented backup routing in mobile ad hoc networks. In Proceedings of the 12th IEEE International Conference on Networks (ICON) (pp. 331–335).

  17. Chen, H.-L., & Lee, C.-H. (2005). Two hops backup routing protocol in mobile ad hoc networks. In Proceedings of the 11th International Conference on Parallel and Distributed Systems (pp. 600–604).

  18. Yu, C. W., Wu, T. K., & Cheng, R. H. (2007). A low overhead dynamic route repairing mechanism for mobile ad hoc networks. Computer Communications, 30, 1152–1163.

    Article  Google Scholar 

  19. Cheng, R.-H., Wu, T.-K., Yu, C. W., & Kuo, C.-H. (2006). An altitude based dynamic routing scheme for ad hoc networks. Lecture Notes in Computer Science, 4138, 609–619.

    Article  Google Scholar 

  20. Lai, W. K., Hsiao, S.-Y., & Lin, Y.-C. (2007). Adaptive backup routing for ad-hoc networks. Computer Communications, 30, 453–464.

    Article  Google Scholar 

  21. Sengul, C., & Kravets, R. (2006). Bypass routing: An on-demand local recovery protocol for ad hoc networks. Ad Hoc Networks, 4(3), 380–397.

    Article  Google Scholar 

  22. Lee, S. J., Royer, E., & Perkins, C. E. (2003). Scalability study of the ad hoc on demand distance vector routing protocol. International Journal of Network Management, 13(2), 97–114.

    Article  Google Scholar 

  23. Castañeda, R., Das, S. R., & Marina, M. K. (2002). Query localization techniques for on-demand routing protocols in ad hoc networks. Wireless Networks, 8, 137–151.

    Article  MATH  Google Scholar 

  24. Soliman, H., & Al-Otaibi, M. (2009). An efficient routing approach over mobile wireless ad-hoc networks. In IEEE Consumer Communications and Networking Conference (Jan., pp. 1–5).

  25. Tsai, H.-M., Wisitpongphan, N., & Tonguz, O. K. (2006). Link-quality aware ad hoc on-demand distance vector routing protocol. In 1st International Symposium on Wireless Pervasive Computing.

  26. Boukerche, A., & Zhang, L. (2004). A performance evaluation of a pre-emptive on-demand distance vector routing protocol for mobile ad hoc networks. Wireless Communications and Mobile Computing, 4, 99–108.

    Article  Google Scholar 

  27. Goff, T., Abu-ghazaleh, N. B., Phatak, D. S., & Kahvecioglu, R. (2003). Preemptive routing in ad hoc networks. Journal of Parallel and Distributed Computing, 63(2), 123–140.

    Article  MATH  Google Scholar 

  28. Zapata, M. G. (2005). Shortcut detection and route repair in ad hoc networks. In Third IEEE International Conference on Pervasive Computing and Communications Workshops (pp. 237–242).

  29. Wu, S. L., Tseng, Y. C., & Sheu, J. P. (2000). Intelligent medium access for mobile ad hoc networks with busy tones and power control. IEEE Journal on Selected Areas in Communications, 18(9), 1647–1657.

    Article  Google Scholar 

  30. Fall, K., & Varadhan, K. (1999). Ns notes and documentation. The VINT Project, UC Berkeley, LBL, USC/ISI, and Xerox PARC, November, 1999.

  31. Hogie, L., & Bouvry, P. (2006). An overview of MANETs simulation. Electronic Notes in Theoretical Computer Science, 150, 81–101.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Management, Hsuan Chuang University, Hsin-Chu, Taiwan, ROC

    Rei-Heng Cheng

  2. Department of Information Management, National Changhua University of Education, No. 2, Shi-Da Rd, Changhua City, Taiwan, ROC

    Tung-Kuang Wu

  3. Department of Computer Science and Information Engineering, Chung Hua University, Hsin-Chu, Taiwan, ROC

    Chang Wu Yu

Authors
  1. Rei-Heng Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tung-Kuang Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chang Wu Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tung-Kuang Wu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cheng, RH., Wu, TK. & Yu, C.W. A highly topology adaptable ad hoc routing protocol with complementary preemptive link breaking avoidance and path shortening mechanisms. Wireless Netw 16, 1289–1311 (2010). https://doi.org/10.1007/s11276-009-0203-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-009-0203-0

Keywords