Degraded Link-disjoint multipath routing in ad hoc networks

This paper presents a multiple-path routing protocol, called as degraded link-disjoint multipath (DLDM) routing protocol, which is based on ad-hoc on-demand distance vector(AODV) routing protocol for ad-hoc networks. The proposed protocol establishes disjoint-link paths if disjoint-link paths exist in the network and establishes multiple-path routing that have no more than one common link according to the network condition during the route discovery procedure. This saves network bandwidth and reduces route reconstruction time when a routing path fails. Our modeling effort shows while that proposed multipath routing is significantly better than AOMDV, the performance advantage is small beyond a few paths and for long path lengths. It also shows that the routing overhead and the route reconstruction time to find a new route is reduced. We perform simulation experiments which validate these findings.