A hybrid protocol for identification of a maximal set of node disjoint paths in mobile Ad hoc networks

Identifying a maximal set of node-disjoint paths between a given source and a destination is a challenging task in mobile ad hoc networks. One cannot guarantee to identify the maximal set of node-disjoint paths in a single sequence of request-reply cycle. However, one can guarantee to identify a maximal set of node-disjoint paths in an incremental fashion using multiple route discoveries. In this paper, we present a protocol that adopts an approach that is a hybrid of the approaches taken by a protocol that tries to identify multiple node-disjoint paths in a single go and a protocol that identifies them incrementally. Our approach preserves the guarantee to discover a maximal set of node-disjoint paths between a given source and a destination. Further, we have shown that our approach is scalable and it requires less number of route discoveries than that required by an incremental protocol.

[1]  Ash Mohammad Abbas,et al.  Path diminution in disjoint multipath routing for mobile ad hoc networks , 2004, 2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754).

[2]  Marwan Krunz,et al.  Linear time distributed construction of colored trees for disjoint multipath routing , 2007, Comput. Networks.

[3]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[4]  Elizabeth M. Belding-Royer,et al.  Dynamically Adaptive Multipath Routing based on AODV , 2004 .

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

[6]  Eui-nam Huh,et al.  Enhanced Multipath Routing Protocol Using Congestion Metric in Wireless Ad Hoc Networks , 2006, EUC.

[7]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[8]  A. Mohammad Abbas,et al.  Multiple attempt node-disjoint multipath routing for mobile ad hoc networks , 2006, 2006 IFIP International Conference on Wireless and Optical Communications Networks.

[9]  Ash Mohammad Abbas,et al.  An Improvement over Incremental Approach for Guaranteed Identification of Multiple Node-Disjoint Paths in Mobile Ad hoc Networks , 2007, 2007 2nd International Conference on Communication Systems Software and Middleware.

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

[11]  Ash Mohammad Abbas,et al.  Path Diminution is Unavoidable in Node-Disjoint Multipath Routing with Single Route Discovery , 2006, 2006 1st International Conference on Communication Systems Software & Middleware.

[12]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[13]  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).

[14]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[15]  Ash Mohammad Abbas,et al.  A Disjoint Alternate Path Routing for Mobile Ad hoc Networks , 2005 .

[16]  Raouf Boutaba,et al.  Totally Disjoint Multipath Routing in Multihop Wireless Networks , 2006, 2006 IEEE International Conference on Communications.

[17]  Christian Bettstetter,et al.  On the minimum node degree and connectivity of a wireless multihop network , 2002, MobiHoc '02.

[18]  A.M. Abbas,et al.  Analysis of disjoint multipath routing for mobile ad hoc networks , 2005, 2005 IEEE International Conference on Personal Wireless Communications, 2005. ICPWC 2005..

[19]  Ash Mohammad Abbas.  Disjoint multipath routing for mobile ad hoc networks , 2007 .

[20]  Chuan-Ching Sue,et al.  A Hybrid Multipath Routing in Mobile ad hoc Networks , 2006, 2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06).

[21]  Muhammad H. Alsuwaiyel,et al.  Algorithms - Design Techniques and Analysis , 1999, Lecture Notes Series on Computing.

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

[23]  Dipak Ghosal,et al.  Multipath Routing in Mobile Ad Hoc Networks: Issues and Challenges , 2003, MASCOTS Tutorials.

[24]  A.M. Abbas,et al.  An Analytical Framework for Route Failure Time of Multiple Node-Disjoint Paths in Mobile Ad hoc Networks , 2006, Networks 2006. 12th International Telecommunications Network Strategy and Planning Symposium.

[25]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[26]  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).

[27]  Ash Mohammad Abbas,et al.  Mitigating Overheads and Path Correlation in Node-Disjoint Multipath Routing for Mobile Ad hoc Networks , 2006, 2006 1st International Conference on Communication Systems Software & Middleware.