Path Optimization Of AODV By EO-AODV In MANET
Krishhna Mahajan, Murtaza Abbas Rizvi, D. Singh Karaulia · 2014
The Ad-hoc on demand Distance Vector (AODV) is semi dynamic in nature, it assumes the discovered route is the optimum one and uses it for data transfer for the data session. But nodes mobility may give rise to more optimal routes and AODV does not adopt this optimal route. AODV does not discover the new shorter route until a route break occurs. This route break results in abrupt halt in communication and requires rediscovery of the new route, which increases the delay and routing overhead. A need of dynamic route optimization is felt to adopt these optimal routes dynamically. Many attempts have been made so far to solve the problem of route optimization. In this paper, a new approach is devised as `Event driven dynamic path optimization for AODV in MANET' for route optimization and modified AODV is called EO-AODV. Simulated results have been analyzed and compared with standard AODV. The results obtained from EO-AODV are found to be performing better on all parameters of comparison as against the performance in AODV. The results are shown graphically. It is finally deduced that EO-AODV as proposed by the authors is a better protocol modification and has potential to outperform AODV in its performance.