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

[1]  Satish K. Tripathi,et al.  A framework for reliable routing in mobile ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[2]  Peter P. Pham,et al.  Performance analysis of reactive shortest path and multipath routing mechanism with load balance , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  R. Thurimella,et al.  Algorithms for Finding Disjoint Paths in Mobile Networks , 2004 .

[4]  Samir Ranjan Das,et al.  Performance of Multipath Routing for On-Demand Protocols in Mobile Ad Hoc Networks , 2001, Mob. Networks Appl..

[5]  Xingang Guo,et al.  Guaranteed on-demand discovery of node-disjoint paths in ad hoc networks , 2007, Comput. Commun..