Abstract
In a wireless sensor network, when two or more forwarding paths share a common link that link is overloaded compared to an unshared link. The overload may cause congestion at the terminal nodes of that link. Therefore, link-disjoint paths are preferred to reduce the eventual congestion. When the topology does not support full link-disjoint paths, the primary objective is to maximize the link-disjoint paths or to minimize the shared-link paths to alleviate congestion. When several minimum shared-link paths are available, we select the least-cost route. Since the data forwarding task is basically, “many to one” communication, the least-cost minimum shared-link paths form a tree. Thus, the goal is to determine the optimal tree which has minimum shared-link paths with least cost. A new iterative algorithm is presented to determine such an optimal tree. The number of iterations is equal to the number of sources. In the first iteration, we construct the shortest path for one of the sources and assign virtual weights to the edges (links) of that path. Then, calculate the next minimum edge weight path from the next source and so on. The virtual weights are manipulated from iteration to iteration in such a way that the least cost and the minimum shared-link criteria are satisfied. The proposed algorithm adjusts the virtual weights and determines the shortest path. This is a centralized algorithm which can be easily converted into a distributed one.
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
References
Incel, O.D., Gosh, A., Krishnamachari, B., Chintalapudi, K.: Fast data collection in tree-based wireless sensor networks. IEEE Trans. Mob. Comput. 1, 86–99 (2012)
Incel, O.D., Ghosh, A., Krishnamachari, B., Chintalapudi, K.: Fast data collection in tree-based wireless sensor networks 11(1) (2012)
Gandham, S., Zhang, Y., Huang, Q.: Distributed time-optimal scheduling for convergecast in wireless sensor networks. Comput. Netw. 52(3), 610–629 (2008)
Yilmaz, O., Demirci, S.: Shortest hop multipath algorithm for wireless sensor networks. Comput. Math Appl. 63(1), 48–59 (2012)
Guo, W., Park, J.H., Yang, L.T., Vasilakos, A.V., Xiong, N., Chen, G.: Design and analysis of a SPT-based topology control scheme with PSO for wireless sensor networks. In: 2011 IEEE Asia-Pacific Services Computing Conference, Jeju Island, pp. 360–367 (2011)
Zheng, S.Q., Yang, B., Yang, M., Wang, J.: Finding minimum-cost paths with minimum sharability. In: IEEE INFOCOM 2007—26th IEEE International Conference on Computer Communications, Anchorage, AK, pp. 1532–1540 (2007)
Omran, M.T., Sack, J.-R., Zarrabi-Zadeh, H.: Finding paths with minimum shared edges. In: Proceedings of 17th Annual International Conference on Computing and Combinatorics, Volume 6842 of Lecture Notes on Computer Science, pp. 567–578 (2011)
Mamdouh, M., Elsayed, K., Khattab, A.: RPL load balancing via minimum degree spanning tree. In: 2016 IEEE 12th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), New York, NY, pp. 1–8 (2016)
Christian, L., Mario. V.-P.: A distributed approximation algorithm for the minimum degree minimum weight spanning trees. J. Parallel Distrib. Comput. 68(2), 200–208 (2008)
Bag-Mohammadi, M., Samadian-Barzoki, S., Yazdani, N.: Near receiver branching point multicast protocol. In: 9th Asia-Pacific Conference on Communications (IEEE Cat. No. 03EX732), vol. 3, pp. 1167–1171 (2003)
Shi, K., Song, Q., Lin, S., Xu, G., Cao, Z.: An improved genetic algorithm for degree-constrained minimum spanning trees. In: 2016 Chinese Control and Decision Conference (CCDC), Yinchuan, pp. 4603–4607 (2016)
Zhou, G., Gen, M.: Genetic algorithm approach on multi-criteria minimum spanning tree problem. Eur. J. Oper. Res. 114(1) (1999)
Sun, X., Chang, C., Su, H., Rong, C.: Novel degree constrained minimum spanning tree algorithm based on an improved multicolony ant algorithm. Math. Probl. Eng. 2015(4), 1–13 (2015)
Párraga-Álava, J., Dorn, M., Inostroza-Ponta, M.: Using local search strategies to improve the performance of NSGA-II for the multi-C minimum spanning tree problem. In: 2017 IEEE Congress on Evolutionary Computation (CEC), San Sebastian, pp. 1119–1126 (2017)
Lu, Y.: The improvement of multi-criterion minimum spanning tree based on the GA. In: 2011 International Conference of Information Technology, Computer Engineering and Management Sciences, Nanjing, Jiangsu, pp. 107–109 (2011)
Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. J. ACM 45(5), 783–797 (1998)
Itai, A., Perl, Y., Shiloach, Y.: The complexity of finding maximum disjoint paths with length constraints. Networks 12(3), 277–286 (1982)
Kobayashi, Y., Sommer, C.: On shortest disjoint paths in planar graphs. Discrete Optim. 7(4), 234–245 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Thomas, S., Mathew, T. (2019). Minimum Shared-Link-Count Forwarding for Alleviating Congestion in Wireless Sensor Networks. In: Ray, K., Sharan, S., Rawat, S., Jain, S., Srivastava, S., Bandyopadhyay, A. (eds) Engineering Vibration, Communication and Information Processing. Lecture Notes in Electrical Engineering, vol 478. Springer, Singapore. https://doi.org/10.1007/978-981-13-1642-5_38
Download citation
DOI: https://doi.org/10.1007/978-981-13-1642-5_38
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-1641-8
Online ISBN: 978-981-13-1642-5
eBook Packages: EngineeringEngineering (R0)