Multiple attempt node-disjoint multipath routing for mobile ad hoc networks

Identifying multiple node-disjoint paths between a given source and a destination is a challenging issue in mobile ad hoc networks. One cannot guarantee to identify multiple node-disjoint paths in a single route discovery. However, one can identify multiple node-disjoint paths in multiple attempts in an incremental fashion. In this paper, we propose an improved version of a protocol to identify multiple node-disjoint paths between a given source and a destination. We have analytically shown that our version consumes less number of route discoveries than that required by existing protocols