ADAPTIVE LOCAL REPAIR ALGORITHMS FOR AD-HOC ON-DEMAND DISTANCE VECTOR ROUTING PROTOCOL

Abstract

AODVLRT gives the lowest routing message overhead by on average 18.86% reduction less than AODV routing message overhead. In the same time, AFLRS and AFLRSLRT have a reduction in routing message overhead by on average 17.19% and 15.32% less than AODV routing message overhead, respectively. AODYLRT gives the nighest average end to end delay by on average 28.02% reduction less than AODV average end to end delay. In the same time, AFLRS and AFLRSLRT have a reduction in average end to end delay by on average 16.83% and 18.03% less than AODV average end to end delay, respectively. AODYLRT gives the highest throughput in this scenario by on average 29.68% increase more than AODV throughput. In the same time, AFLRS and AFLRSLRT have an increase more than AODV throughput by on average 19.46% and 20.34%, respectively.