Skip to main content
Log in

P-AODV: A Priority Based Route Maintenance Process in Mobile Ad Hoc Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

We present a route maintenance mechanism, P-AODV, which repairs a route by selecting a neighbor on the basis of the traffic being handled by it. A new parameter, priority, is introduced to segregate the nodes into high priority and low priority categories. The availability of a high priority neighbor is required for the success of P-AODV. A highly dense network—our focus—increases the probability of such neighbors in the vicinity of upstream nodes. The priorities are advertised through Hello Packets and stored in Neighbor Tables. Alternate paths are made available at neighbor nodes by overhearing the traffic. In dense networks, avoiding reroute discoveries by selecting neighbors averts the overhead caused by control packets, inherent congestion and delay. Further, we have introduced a Controlled Re-Route Discovery in P-AODV to reduce the control packets transmission. P-AODV substantially improves the overall performance of the network. In this paper we have implemented our algorithms in AODV code of network simulator, ns 2.34, and the results were compared with the existing route maintenance methods of AODV, and RLLR. Chain topologies, running constant bit rate, are created with some neighbors either common to the chains or standalones. The simulation results show significant improvement in routing overhead reduction, packet delivery ratio, and considerable improvement in throughput and end-to-end delay (reduction), comparing P-AODV and AODV.

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.

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
Fig. 19

Similar content being viewed by others

References

  1. Bilgin, Z., & Khan, B. (2010). A dynamic route optimization mechanism for AODV in MANETs. In 2010 IEEE International conference on communications. doi: 10.1109/icc.2010.5502381.

  2. Zoulikha, M. M., & Amal, B. (2014). Cross-layer approach among physical, MAC and routing layer in a shadowing environment. Ad Hoc & Sensor Wireless Networks, 21(1–2), 101–119.

    Google Scholar 

  3. Richard, C., Perkins, C., & Westphal, C. (2005). Defining an optimal active route time-out for the aodv routing protocol. In IEEE Secon.

  4. Chuang, P.-J., Yen, P.-H., Chu, T.-Y. (2012). Efficient route discovery and repair in mobile ad hoc networks. In 2012 IEEE 26th international conference on advanced information networking and applications. doi: 10.1109/aina.2012.120.

  5. Abdulai, J.-D., Ould-Khaoua, M., & Mackenzie, L. M. (2009). Adjusted probabilistic route discovery in mobile ad hoc networks. Computers & Electrical Engineering, 35, 168–182. doi:10.1016/j.compeleceng.2008.07.002.

    Article  MATH  Google Scholar 

  6. Alotaibi, E., & Mukherjee, B. (2012). A survey on routing algorithms for wireless ad-hoc and mesh networks. Computer Networks, 56, 940–965. doi:10.1016/j.comnet.2011.10.011.

    Article  Google Scholar 

  7. Guo, L., Peng, Y., Wang, X., Jiang, D., & Yu, Y. (2011). Performance evaluation for on-demand routing protocols based on OPNET modules in wireless mesh networks. Computers & Electrical Engineering, 37, 106–114. doi:10.1016/j.compeleceng.2010.10.002.

    Article  Google Scholar 

  8. Kim, S., Lee, O., Choi, S., & Lee, S.-J. (2011). Comparative analysis of link quality metrics and routing protocols for optimal route construction in wireless mesh networks. Ad Hoc Networks, 9, 1343–1358. doi:10.1016/j.adhoc.2011.03.011.

    Article  Google Scholar 

  9. Dengiz, O., Konak, A., & Smith, A. E. (2011). Connectivity management in mobile ad hoc networks using particle swarm optimization. Ad Hoc Networks, 9, 1312–1326. doi:10.1016/j.adhoc.2011.01.010.

    Article  Google Scholar 

  10. Khalaf, M. B., Al-Dubai, A. Y., Buchanan, W. (2010). A new adaptive broadcasting approach for mobile ad hoc networks. In 2010 Wireless Advanced 2010. doi: 10.1109/wiad.2010.5544944.

  11. Park, C.-S., Lee, K.-W., Kim, Y.-S., & Ko, S.-J. (2007). A route maintaining algorithm using neighbor table for mobile sinks. Wireless Networks, 15, 541–551. doi:10.1007/s11276-007-0068-z.

    Article  Google Scholar 

  12. Bilgin, Z., Khan, B. (2010). A dynamic route optimization mechanism for AODV in MANETs. In 2010 IEEE international conference on communications. doi: 10.1109/icc.2010.5502381.

  13. Yen, Y.-S., Chang, H.-C., Chang, R.-S., & Chao, H.-C. (2010). Routing with adaptive path and limited flooding for mobile ad hoc networks. Computers & Electrical Engineering, 36, 280–290. doi:10.1016/j.compeleceng.2009.03.002.

    Article  MATH  Google Scholar 

  14. Yu, K.-M., Yu, C. W., & Yan, S.-F. (2009). An ad hoc routing protocol with multiple backup routes. Wireless Personal Communications, 57, 533–551. doi:10.1007/s11277-009-9860-7.

    Article  Google Scholar 

  15. Gupta, S. K., Sharma, R., & Saket, R. K. (2014). Effect of variation in active route timeout and delete period constant on the performance of AODV protocol. International Journal of Mobile Communications, 12, 177. doi:10.1504/ijmc.2014.059737.

    Article  Google Scholar 

  16. Varaprasad, G. (2011). Lifetime enhancement routing algorithm for mobile ad hoc networks. IET Communications, 5, 119–125. doi:10.1049/iet-com.2010.0134.

    Article  Google Scholar 

  17. Reina, D. G., Toral, S. L., Johnson, P., & Barrero, F. (2013). Improving discovery phase of reactive ad hoc routing protocols using Jaccard distance. The Journal of Supercomputing, 67, 131–152. doi:10.1007/s11227-013-0992-x.

    Article  Google Scholar 

  18. Chuang, P.-J., Yen, P.-H., Chu, T.-Y. (2012). Efficient route discovery and repair in mobile ad hoc networks. In 2012 IEEE 26th international conference on advanced information networking and applications. doi: 10.1109/aina.2012.120.

  19. Lai, W. K., Hsiao, S.-Y., & Lin, Y.-C. (2007). Adaptive backup routing for ad-hoc networks. Computer Communications, 30, 453–464. doi:10.1016/j.comcom.2006.09.011.

    Article  Google Scholar 

  20. Al-Jarrah, O., & Megdadi, O. (2009). Enhanced AODV routing protocol for bluetooth scatternet. Computers & Electrical Engineering, 35, 197–208. doi:10.1016/j.compeleceng.2008.10.001.

    Article  MATH  Google Scholar 

  21. Huang, S.-C., & Chang, H.-Y. (2014). A bidirectional route repair method for wireless mobile ad hoc networks. The Computer Journal, 58, 338–353. doi:10.1093/comjnl/bxu042.

    Article  Google Scholar 

  22. Jain, J., Bandhopadhyaya, T. K., & Gupta, R. (2014). Performance analysis of proposed local link repair schemes for ad hoc on demand distance vector. IET Networks, 3, 129–136. doi:10.1049/iet-net.2013.0063.

    Article  Google Scholar 

  23. Perkins, C., Belding-Royer, E., & Das, S. (2003). Ad hoc on-demand distance vector (AODV) routing. doi:10.17487/rfc3561.

  24. www.isi.edu/nsnam/ns/.

  25. Khalaf, M. B., Al-Dubai, A. Y., & Min, G. (2015). New efficient velocity-aware probabilistic route discovery schemes for high mobility ad hoc networks. Journal of Computer and System Sciences, 81, 97–109. doi:10.1016/j.jcss.2014.06.014.

    Article  MATH  Google Scholar 

  26. Sarkar, S., & Datta, R. (2013). AODV-based technique for quick and secure local recovery from link failures in MANETs. International Journal of Communication Networks and Distributed Systems, 11, 92. doi:10.1504/ijcnds.2013.054858.

    Article  Google Scholar 

  27. Valera, A., Tan. H. P., & Seah, W. K. G. (2010). Improving link failure detection and response in IEEE 802.11 wireless ad hoc networks. In 21st Annual IEEE international symposium on personal, indoor and mobile radio communications. doi: 10.1109/pimrc.2010.5671635.

  28. Ashraf, U., Abdellatif, S., & Juanole, G. (2011). Route maintenance in IEEE 802.11 wireless mesh networks. Computer Communications, 34, 1604–1621. doi:10.1016/j.comcom.2011.02.010.

    Article  Google Scholar 

  29. Issariyakul, T., Hossain, E. (2012). Introduction to network simulator NS2. doi: 10.1007/978-1-4614-1406-3.

  30. Perkins, C. (2001). Ad hoc networking. Boston: Addison-Wesley.

    Google Scholar 

  31. Wu, Y., Zhao, J., & Li, X.-Y. (2014). Throughput optimization in wireless mesh networks using zero-sum game. Ad Hoc & Sensor Wireless Networks, 21(1), 151–175.

    Google Scholar 

  32. Kim, S. K., Choi, J. H., & Yang, S. B. (2015). Hotspot: Location-based forwarding scheme in an opportunistic network. Ad Hoc & Sensor Wireless Networks, 26(1), 151–170.

    Google Scholar 

  33. Jathar, R., Yadav, V., & Gupta, A. (2014). Using periodic contacts for efficient routing in delay tolerant networks. Ad-Hoc & Sensor Wireless Networks, 22(1/2), 283–308.

    Google Scholar 

  34. Yang, S., Li, Z., Stojmenovic, M., Wang, C., & Jian, C. (2015). ERUPT: A role-based neighbor discovery protocol for mobile social applications. Ad Hoc & Sensor Wireless Networks, 24(3/4), 265–281.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dhirendra Kumar Sharma.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sharma, D.K., Patra, A.N. & Kumar, C. P-AODV: A Priority Based Route Maintenance Process in Mobile Ad Hoc Networks. Wireless Pers Commun 95, 4381–4402 (2017). https://doi.org/10.1007/s11277-017-4085-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-017-4085-7

Keywords

Navigation