In today’s networking world Mobile Adhoc Networks are used in a wide range and the across these MANETs routing is controlled using several routing protocols. The multicast and unicast routing throughout the MANETs is supported by a particularly designed routing protocol called “Adhocon Demand Distance Vector” routing protocol which is simple called as AODV routing protocol. On demand principle is used as the common nature of this AODV algorithm, here based on the dynamic decision of the source node the specific routes and their actual routing are built.
Using this routing protocol the instructions are passed by source to modify or add the routes that are predefined and this passing depends on the parameters of networking such as congestion and bandwidth. This routing protocol maintains the tree based structure which is typical; the composition of this tree is done using the nodesand group members and these nodes are used to connect the members of the multicast routing. Even though this protocol possesses some common characteristics of proactive protocols, this is considered as the reactive protocol.
The “Dynamic Source Routing Protocol” DSR is basis for implementing the AODV routing protocol technically, where the route discovery process from the DSDV (Destination Sequence Distance Vector) and DSR (Dynamic Source Routing) protocols is inherited by the AODV routing protocol, and in addition to these the concept of maintaining the transmitted order of hello messages is also inherited by this routing protocol.
The most available and essential feature of AODV routing protocol is states of each and every node that is based on time, where a node expires automatically when it remains unused. If in case some failures are observed in the routes or if there are any differences in the routes then the neighboring nodes are updated using AODV routing protocol. In order to reach the destination node AODV selects the most recent route.
This paper is written and submitted by Sujana Priya V.