Secured Optimal Adaptable Ad-Hoc Routing Protocol in MANET
In a Mobile Ad-hoc NETwork (MANET), each node can freely move around, as the network topology changes dynamically. The Ad-hoc On-demand Distance Vector routing protocol (AODV) is a familiar routing protocol in MANET. The AODV protocol works in a dynamic fashion, by establishing a route on demand and continues that route until it breaks. Due to the changing network topology of ad hoc networks, if other routes with a lesser hop count become available, the network topology is not able to adapt until the route break occurs. This paper proposes a route shortening scheme by replacing some redundant nodes in the active route with a node that is not on the active route, in a secure manner.