Guaranteed on-demand discovery of node-disjoint paths in ad hoc networks

In recent years, the low cost and abundance of WLAN products has led to the deployment of self-configuring multihop ad hoc networks. Multipath routing has been increasingly studied to improve network reliability and throughput. However, no existing work guarantees discovery of node-disjoint paths when they exist, which limits their applicability in real networks. This paper presents a theoretical framework that establishes the equivalence between multipath discovery and flow network assignment. This equivalence is used to guarantee the on-demand discovery of an arbitrary number of node-disjoint paths between a pair of nodes as long as they exist. We also present an example protocol that integrates the theoretical framework with the Dynamic Source Routing (DSR) protocol to find two node-disjoint paths, which can be easily extended to finding k node-disjoint paths. Analysis of the example protocol demonstrates a good tradeoff between complexity and capability, particularly when compared with existing on-demand multipath routing protocols. Our simulation data shows the effectiveness of the discovered paths.

[1]  J. W. Suurballe.  Disjoint paths in a network , 1974, Networks.

[2]  Sung-Ju Lee,et al.  Split multipath routing with maximally disjoint paths in ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[3]  Robert E. Tarjan,et al.  Network Flow and Testing Graph Connectivity , 1975, SIAM J. Comput..

[4]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[5]  J. J. Garcia-Luna-Aceves,et al.  MDVA: a distance-vector multipath routing protocol , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[6]  Ramesh Bhandari.  Survivable Networks: Algorithms for Diverse Routing , 1998 .

[7]  Eytan Modiano,et al.  Minimum energy disjoint path routing in wireless ad-hoc networks , 2003, MobiCom '03.

[8]  J. J. Garcia-Luna-Aceves,et al.  Loop-free multipath routing using generalized diffusing computations , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[9]  Samir R. Das,et al.  On-demand multipath routing for mobile ad hoc networks , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[10]  Eytan Modiano,et al.  Finding Minimum Energy Disjoint Paths in Wireless Ad-Hoc Networks , 2005, Wirel. Networks.

[11]  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.

[12]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2003, MobiCom '03.

[13]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[14]  Ramesh Bhandari.  Optimal diverse routing in telecommunication fiber networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

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

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

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

[18]  Deborah Estrin,et al.  Highly-resilient, energy-efficient multipath routing in wireless sensor networks , 2001, MOCO.

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

[20]  Mahesh K. Marina,et al.  On-demand multipath distance vector routing in ad hoc networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.