Affiliation:
1. Ege University, Turkey
Abstract
k-Connectivity detection and restoration are important problems in graph theory and computer networks. A graph is k-connected if it remains connected after removing k-1 arbitrary nodes. The k-connectivity is an important property of a distributed system because a k-connected network can tolerate k-1 node failures without losing the network connectivity. To achieve the k-connectivity in a network, we need to determine the current connectivity value and try to increase connectivity if the current k is lower than the desired value. This chapter reviews the central and distributed algorithms for detecting and restoring the k-connectivity in graphs and distributed systems. The algorithms will be compared from complexity, accuracy and efficiency perspectives.
Reference24 articles.
1. Mobile wireless sensor network connectivity repair with k-redundancy.;N.Atay;Algorithmic Foundation of Robotics,2010
2. Complete optimal deployment patterns for full-coverage and k-connectivity (k≤ 6) wireless sensor networks.;X.Bai;Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing,2008
3. On the minimum node degree and connectivity of a wireless multihop network
4. Cornejo, A., & Lynch, N. (2010). Fault-tolerance through k-connectivity. Workshop on Network Science and Systems Issues in Multi-Robot Autonomy.
5. Curia, V., Tropea, M., Fazio, P., & Marano, S. (2014). Complex networks: Study and performance evaluation with hybrid model for Wireless Sensor Networks. IEEE 27th Canadian Conference on Electrical and Computer Engineering (CCECE), (pp. 1-5). IEEE.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Quality Enhancement in Underwater Sensor Networks Through Node Deployment Plans;Energy-Efficient Underwater Wireless Communications and Networking;2021
2. Complex Networks;Texts in Computer Science;2018