DFDP: A Distributed Algorithm for Finding Disjoint Paths in Wireless Sensor Networks with Correctness Guarantee

In wireless sensor networks, routing messages through multiple (node) disjoint paths between two sensor nodes is a promising way to increase robustness, throughput, and load balance. This paper proposes an efficient distributed algorithm named distributedly finding disjoint paths (DFDP) to find k disjoint paths connecting two given nodes s and t. A set of paths connecting s and t are disjoint if any two of them do not have any common nodes except s and t. Unlike the existing distributed algorithms, DFDP guarantees correctness; that is, it will output k disjoint paths if there exist k disjoint paths in the network or the maximum number of disjoint paths otherwise. Compared with the centralized algorithms which also guarantee correctness, DFDP is shown to have much better efficiency and load balance by theory analysis and simulation results.

[1]  Alon Itai,et al.  The complexity of finding maximum disjoint paths with length constraints , 1982, Networks.

[2]  Yehoshua Perl,et al.  Heuristics for finding a maximum number of disjoint bounded paths , 1984, Networks.

[3]  Nachum Shacham,et al.  A distributed algorithm for finding shortest pairs of disjoint paths , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[4]  Samir Khuller,et al.  Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.

[5]  Deepinder P. Sidhu,et al.  Finding disjoint paths in networks , 1991, SIGCOMM '91.

[6]  Tohru Kikuno,et al.  A routing protocol for finding two node-disjoint paths in computer networks , 1995, Proceedings of International Conference on Network Protocols.

[7]  Kazuo Iwama,et al.  A Faster Parallel Algorithm for k-Connectivity , 1997, Inf. Process. Lett..

[8]  Ramesh Bhandari,et al.  Optimal physical diversity algorithms and survivable networks , 1997, Proceedings Second IEEE Symposium on Computer and Communications.

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

[10]  Andreas Bley,et al.  On the complexity of vertex-disjoint length-restricted path problems , 2004, computational complexity.

[11]  B. R. Badrinath,et al.  ReInForM: reliable information forwarding using multiple paths in sensor networks , 2003, 28th Annual IEEE International Conference on Local Computer Networks, 2003. LCN '03. Proceedings..

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

[13]  Chen Gui-hai.  AMR:A Multipath Routing Algorithm Based on Maximum Flow in Ad-Hoc Networks , 2004 .

[14]  Shanping Li,et al.  Node-disjoint parallel multi-path routing in wireless sensor networks , 2005, Second International Conference on Embedded Software and Systems (ICESS'05).

[15]  Dae-Wha Seo,et al.  An Energy-Efficient k -Disjoint-Path Routing Algorithm for Reliable Wireless Sensor Networks , 2007, SEUS.

[16]  Li Jianzhong,et al.  A Disjoint Multi-Path Routing Algorithm in Wireless Sensor Network , 2009 .

[17]  Teresa Gomes,et al.  An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs , 2009, Comput. Oper. Res..

[18]  A. L. Narasimha Reddy,et al.  Disjoint Multi-Path Routing and Failure Recovery , 2010, 2010 IEEE International Conference on Communications.

[19]  Jacek Rak.  κ-Penalty: a novel approach to find κ-Disjoint paths with differentiated path costs , 2010, IEEE Communications Letters.

[20]  A. Kumar,et al.  Geographic Node-Disjoint Path Routing for Wireless Sensor Networks , 2010, IEEE Sensors Journal.

[21]  Kaoru Sezaki,et al.  Internode Distance-Based Redundancy Reliable Transport in Underwater Sensor Networks , 2010, EURASIP J. Wirel. Commun. Netw..

[22]  Hichem Snoussi,et al.  Optimal path selection for quantized target tracking in distributed sensor networks , 2011, 2011 7th International Wireless Communications and Mobile Computing Conference.

[23]  Yi Zhu,et al.  Efficient node-disjoint paths search in WDM networks with asymmetric nodes , 2011, 2011 37th European Conference and Exhibition on Optical Communication.

[24]  Bernard Cousin,et al.  Energy efficiency in ad hoc wireless networks with node-disjoint path routing , 2011, International Workshop on Systems, Signal Processing and their Applications, WOSSPA.

[25]  Eiji Oki,et al.  Scheme to Find k Disjoint Paths in Multi-Cost , 2011, 2011 IEEE International Conference on Communications (ICC).

[26]  Yi Zhu,et al.  Node-disjoint paths search in WDM networks with asymmetric nodes , 2011, 15th International Conference on Optical Network Design and Modeling - ONDM 2011.

[27]  Hong Gao,et al.  Efficient distributed algorithm for correctly finding disjoint paths in wireless sensor networks , 2013, Int. J. Sens. Networks.

[28]  J. W. Suuballe,et al.  Disjoint Paths in a Network , 2022 .