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. تفاصيل المقالة

Mobile Ad hoc networks (MANETs) are composed of mobile stations communicating through wireless links, without any fixed backbone support. In these networks, limited power energy supply, and frequent topology changes caused by node mobility, makes their routing a challenging problem. TORA is one of the routing protocols that successfully copes with the nodes’ mobility side effects, but it doesn’t take into the nodes’ energy level. To solve this problem, this paper employs Honey Bee Mating Optimization (HBMO) principles to present a new routing protocol, called HBMO-TORA algorithm. Simulation results show that HBMO-TORA outperforms TORA in terms of packet delivery ratio, network life time, system life time and end-to-end delay. تفاصيل المقالة