Modified Routing Algorithm for AODV in Constrained Conditions

摘要

On-demand routing protocol exhibits abnormal behavior during high mobility and multiple data streams sent to a common destination. This may decay the performance of adhoc on demand distance vector routing (AODV). The proposed work is aimed at performance improvement in internet connectivity by applying local congestion methods in routing protocols. This method increases the packet delivery ratio of AODV even in constrained conditions to a satisfactory level, which has been major concern in the routing algorithm in mobile ad hoc networks. The results are also convincing in improvement in normalized routing load and end to end delay. The numerical results of this work are having improvement over existing algorithms upto 27%.