An Efficient Routing Protocol for Discovering the Optimum Path in Mobile Ad Hoc Networks

Mobile ad hoc networks include mobile nodes which move freely and communicate through wireless links. Due to high mobility of nodes, energy and bandwidth limitation and coverage range limit of nodes, routing in these networks is very complicated. Many routing protocols have been proposed for ad hoc networks. These protocols include a wide range of designing methods, and each has its own particular advantages and disadvantages; thus they can be used in a particular environment with specific conditions. In this paper, we choose an appropriate protocol (AODV) among existing protocols for congestion conditions of a network and fast mobility of nodes. Then we present a method for path backup in order to reduce control overhead and improve the performance of this protocol. Simulation results show that the proposed method has a high performance compared to similar ones.