Distance based dual path ad hoc on demand distance vector routing protocol for mobile ad hoc networks

This paper presents a novel method of selecting an optimal path between the nodes for data transmission in mobile ad hoc network. Mobile ad hoc network is a temporary, infrastructure-less network that communicates in multi-hop manner. Routing is an important issue in mobile ad hoc networks. Normally, routing protocol may selects the path between two nodes based on multiple metrics like distance between the nodes, hops count, delay, trust values, residual energy, received signal strength etc. In this proposed method, two routes are discovered between the source and destination and then by considering the distance metric optimal route is selected for data transmission between the nodes. Simulation results show that the proposed Distance based Dual path Ad hoc On demand Distance Vector (DBDP_AODV) outperforms the normal AODV routing protocol. The proposed routing protocol results in high packet delivery ratio with less average end to end delay and low routing overhead.