Abstract
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.
This work is supported by National Natural Science Foundation of China (Grant No. 61300207), Fundamental Research Funds for the Central Universities (Grant No. HEUCF100610).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baek, J.-W., Nam, Y.J., Seo, D.-W.: An energy-efficient k-disjoint-path routing algorithm for reliable wireless sensor networks. In: Obermaisser, R., Nah, Y., Puschner, P., Rammig, F.J. (eds.) SEUS 2007. LNCS, vol. 4761, pp. 399–408. Springer, Heidelberg (2007)
Bhandari, R.: Optimal physical diversity algorithms and survivable networks. In: Proceedings of the 2nd IEEE Symposium on Computers and Communications, ISCC (1997)
Cai, Z., Chen, Z., Lin, G.: Approximation algorithm for the capacitated multicast tree routing problem. Theoretical Computer Science 410, 5415–5424 (2009)
Cai, Z., Goebel, R., Lin, G.: Size-constrained tree partitioning: a story on approximating the multicast k-tree routing problem. Theoretical Computer Science 412, 240–245 (2011)
Chen, Y., Guo, X., Zeng, Q.: Amr: a multipath routing algorithm based on maximum flow in ad hoc networks. Acta Electronica Sinica 32, 1297–1301 (2004)
Deb, B., Bhatnagar, S., Nath, B.: Reinform: Reliable information forwarding using multiple paths in sensor networks. In: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)
Fang, X., Shi, S., Li, J.: A disjoint multi-path routing algorithm in wireless sensor network. Jounal of Computer Research and Development 46, 2053–2061 (2009)
Ganesan, D., Govindan, R., Shenker, S., Estrin, D.: Highly-resilient, energy-efficient multipath routing in wireless sensor networks. In: Proceedings of the 2nd ACM International Symposium on Mobile Ad hoc Networking & Computing, MobiHoc (2001)
Hashiguchi, T., Tajima, K., Takita, Y., Naito, T.: Node-disjoint paths search in wdm networks with asymmetric nodes. In: International Conference on Optical Network Design and Modeling, ONDM (2011)
Iwama, K., Iwamoto, C., Ohsawa, T.: A faster parallel algorithm for k-connectivity. Information Processing Letters 61, 265–269 (1997)
Khuller, S., Schieber, B.: Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs. In: 30th Annual Symposium on Foundations of Computer Science (1989)
Kumar, A., Varma, S.: Geographic node-disjoint path routing for wireless sensor networks. IEEE Sensors Journal (2010)
Li, S., Wu, Z.: Node-disjoint parallel multi-path routing in wireless sensor networks. In: Proceedings of the Second International Conference on Embedded Software and Systems, ICESS (2005)
Omar, S., Zoulikha, M., Cousin, B.: Energy efficiency in ad hoc wireless networks with node-disjoint path routing. In: International Workshop on Systems, Signal Processing and their Applications, WOSSPA (2011)
Sidhu, D., Nair, R., Abdallah, S.: Finding disjoint paths in networks. In: Proceedings of the Conference on Communications Architecture & Protocols, SIGCOMM (1991)
Srinivas, A., Modiano, E.: Minimum energy disjoint path routing in wireless ad-hoc networks. In: Proceedings of the 9th Annual International Conference on Mobile Computing and Networking, MobiCom (2003)
Suurballe, J.W.: Disjoint paths in a network. Networks 4, 125–145 (1974)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Zhang, K., Gao, H., Yin, G., Han, Q. (2014). OFDP: A Distributed Algorithm for Finding Disjoint Paths with Minimum Total Energy Cost in Wireless Sensor Networks. In: Cai, Z., Wang, C., Cheng, S., Wang, H., Gao, H. (eds) Wireless Algorithms, Systems, and Applications. WASA 2014. Lecture Notes in Computer Science, vol 8491. Springer, Cham. https://doi.org/10.1007/978-3-319-07782-6_62
Download citation
DOI: https://doi.org/10.1007/978-3-319-07782-6_62
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07781-9
Online ISBN: 978-3-319-07782-6
eBook Packages: Computer ScienceComputer Science (R0)