OFDP: A Distributed Algorithm for Finding Disjoint Paths with Minimum Total Energy Cost in Wireless Sensor Networks

This paper investigates the MINimum-energy-cost-k-Disjoint-Paths (MIN-k-DP) problem : in a sensor network, given two nodes s and t, a positive integer k, finding k (node) disjoint paths connecting s and t with minimum total energy cost. An efficient distributed algorithm named Optimally-Finding-Disjoint-Paths (OFDP) is proposed for this problem. OFDP guarantees correctness and optimality, i.e., 1) it will find k disjoint paths if there exist k disjoint paths in the network or the maximum number of disjoint paths otherwise; 2) the disjoint paths it outputs do have minimum total energy cost. To the best of our knowledge, OFDP is the first distributed algorithm that can solve the MIN-k-DP problem with correctness and optimality guarantee. Compared with the existing centralized algorithms which also guarantee correctness and optimality, OFDP is shown to be much more efficient by simulation results.

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

[2]  Alon Itai,et al.  The complexity of finding maximum disjoint paths with length constraints , 1982, 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]  Andreas Bley,et al.  On the complexity of vertex-disjoint length-restricted path problems , 2004, computational complexity.

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

[6]  Weili Wu,et al.  A greedy algorithm for the fault-tolerant connected dominating set in a general graph , 2014, J. Comb. Optim..

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

[8]  Guisheng Yin,et al.  DFDP: A Distributed Algorithm for Finding Disjoint Paths in Wireless Sensor Networks with Correctness Guarantee , 2014, Int. J. Distributed Sens. Networks.

[9]  Yingshu Li,et al.  Minimum-latency aggregation scheduling in wireless sensor network , 2016, J. Comb. Optim..

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

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

[12]  Zhi-Zhong Chen,et al.  An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem , 2008, COCOA.

[13]  Deying Li,et al.  An improved distributed data aggregation scheduling in wireless sensor networks , 2014, J. Comb. Optim..

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

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

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

[17]  Randy Goebel,et al.  Size-constrained tree partitioning: Approximating the multicast k-tree routing problem , 2011, Theor. Comput. Sci..

[18]  Deepinder P. Sidhu,et al.  Finding disjoint paths in networks , 1991, Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication.

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

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

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

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

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

[24]  Zhi-Zhong Chen,et al.  A 3.4713-approximation algorithm for the capacitated multicast tree routing problem , 2009, Theor. Comput. Sci..

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

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

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

[28]  Guohui Lin,et al.  Improved Approximation Algorithms for the Capacitated Multicast Routing Problem , 2005, COCOON.

[29]  Turgay Korkmaz,et al.  Distributed verification of global multiple disjoint paths in mobile wireless networks , 2011, 2011 7th International Wireless Communications and Mobile Computing Conference.