AODV based backup routing for optimized performance in mobile ad-hoc networks

Abstract

Mobile ad hoc network (MANET) is a collection of wireless devices which are moving randomly and communicating with each other without establishing the real infrastructure. Due to dynamic nature, connections in the network can change frequently and nodes can be added or removed at any time. This paper presents a new routing algorithm that is more suitable for a MANET in the sparse environment. This routing algorithm is based on AODV(Ad hoc on demand distance vector), where it stores all the available paths. So whenever the link between the nodes gets break, it can immediately replace with the new route. To select the best path, we are considered energy metric along with hop count. These modification in AODV routing protocol reduced the number of route discovery procedure. Simulation results shows that, there is a significant improvement in packet delivery ratio with reduction in packet loss ratio, routing overhead and average end to end delay.