Performance Analysis of Ad Hoc on-Demand Distance Vector Routing Protocol for Mobile Ad Hoc Networks

An ad hoc network is build up from the cooperative engagement of an accumulation of wireless mobile nodes and is capable of operating without the support of any fixed infrastructure. For a self-starting network having a dynamic nature, routing protocol has the ability to provide optimal communication capable of unicast, broadcast, and multicast routing protocol. An efficient dynamic routing is a challenge in such a network. To develop on-demand routing protocol, ad hoc networks have been widely utilized due to its effectiveness and efficiency in terms of performance factor. So far, a significant amount of research work has been done on routing in ad hoc networks. It is well-known that an Ad hoc network has no fixed routers that mean all nodes are capable to move dynamically be connected in an arbitrary manner. These nodes can act as end system and router at the same time. Transmission power of the nodes and location of MNs are two important factors on which the topology of the ad hoc network depends and may change with time. Since mobile ad hoc networks change their topology frequently, routing in such networks is a challenging task. This research work presents and highlights the significance of Ad hoc On-Demand Distance Vector (AODV) routing protocol, Load Balancing AODV, Modified AODV, and Adaptive Secure AODV. It also provides a comparative analysis of the mentioned protocols. To improve the performance of AODV protocol, a new multipath routing protocol (MAODV) has been used in the research work to discover path simultaneously for transmitting data, balancing load with energy efficiency and packet delivery ratio, and securing the routing in the wireless network.