ad hoc on-demand non overlapped multipath distance vector routing protocol (aonomdv)

in this paper, we propose a scheme to improve existing ad-hoc on-demanddistance vector (aodv) routing protocol by discovering and maintaining multiplenon-overlapped routes. our routing protocol is a multipath version of aodvrouting protocol that considers only the disjoint path. due to non-overlappingamong paths, when a link breaks in the network, only one of paths is expired. thepresented routing protocol, called ad hoc on-demand non overlapped distancevector (aonomdv), is implemented by some modifications over aodv module inns-2 simulator. results of simulations show that aonomdv has better performancein comparison with aodv and aomdv in terms of the average end-to-end delay,the packet delivery ratio and the route discovery frequency.