Event Driven Dynamic Path Optimization for AODV in MANET

Abstract

Route discovery and maintenance in Mobile Ad-hoc Network (MANET) is a problem of long standing interest. In ad-hoc networks the Ad-hoc on demand Distance Vector (AODV) protocol assumes that discovered route is optimal and transmits data on it for the entire data session, whereas due to dynamic topology nodes change position dynamically, the optimum route may change. Thus, node mobility may give rise to more optimal path than already discovered one, making the optimal path suboptimal. AODV does not re-initiate route discovery until link failure or route break occurs which incurs large overhead and increase in delay and is not energy efficient. Therefore, dynamic optimal route discovery should be done. An attempt is made in this paper to find an event based optimum path which is created because of the dynamic topology of the Ad-hoc network and its advantages in data transmission in terms of delay and energy efficiency. Moreover routing information on nodes of active route remains correct. In the literature Anticipated Route Maintenance (ARM), path compression algorithm (PCA), etc. Are some of the approaches used for dynamic route discovery.