Ad Hoc On-demand Non Overlapped Multipath Distance Vector Routing Protocol (AONOMDV)



1 Young Researchers Club, Science and Research Branch, Islamic Azad University, Ardabil, Iran

2 Computer Engineering Department, University of Mohaghegh Ardabili, Ardabil, Iran

3 Department of Computer Engineering, Germi Branch, Islamic Azad University, Germi, Iran


In this paper, we propose a scheme to improve existing Ad-Hoc On-Demand Distance Vector (AODV) routing protocol by discovering and maintaining multiple non-overlapped routes. Our routing protocol is a multipath version of AODV routing protocol that considers only the disjoint path. Due to non-overlapping among paths, when a link breaks in the network, only one of paths is expired. The presented routing protocol, called Ad hoc On-demand Non Overlapped Distance Vector (AONOMDV), is implemented by some modifications over AODV module in ns-2 simulator. Results of simulations show that AONOMDV has better performance in comparison with AODV and AOMDV in terms of the average end-to-end delay, the packet delivery ratio and the route discovery frequency.