A correction for ad hoc on demand multipath distance vector routing protocol (AOMDV)

Abstract

Mobile ad hoc networks are characterized by multi-hop wireless links, the absence of any cellular infrastructure, and frequent host mobility. Due to the dynamic nature of the network topology and the resource constraints, routing in MANETs is a very challenging task. The advantage of multi-path routing in MANETs is not obvious because the traffic along the multiple paths will interfere with each other. In this paper, the Ad Hoc On Demand Multi-path Distance Vector (AOMDV) routing protocol for mobile ad hoc networks has been examined. This algorithm computes alternate loop-free routes and node-disjoint paths. The mechanism used from the AOMDV is not effective in all the situations. We show a particular situation in which the mechanism used by the AOMDV fails and we a solution for this particular condition is proposed. We have analysed the performances of our correction through a tool simulator called NS-2 and we obtained improvements in terms of overhead control and delay.