Abstract
In FANETs, failure of any critical node (cut vertex) separates the networks into disconnected components, resulting in a degradation of connectivity reliability. Therefore, it is crucial to detect the critical nodes to ensure connectivity maintenance in FANETs. Since the existing distributed approaches for detecting critical nodes still suffer from high overhead and low accuracy, this paper proposes an efficient geometric-partition-based distributed algorithm for detecting critical nodes using a novel partitioned framework and geometric theory. The proposed algorithm is divided into two phases, the first phase can detect most of the nodes under the partitioned framework using local neighbor information, the second phase further detects the remaining nodes by identifying geometric cycles formed between these nodes. The simulation results reveals that the proposed algorithm further improves the accuracy, can detect critical nodes in large scale networks more efficiently than existing distributed algorithms, with lower energy consumption and faster speed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Dagdeviren, O., Akram, V.K., Tavli, B.: Design and evaluation of algorithms for energy efficient and complete determination of critical nodes for wireless sensor network reliability. IEEE Trans. Reliab. 68, 280–290 (2019)
Akram, V.K., Dagdeviren, O., Tavli, B.: A coverage-aware distributed k-connectivity maintenance algorithm for arbitrarily large k in mobile sensor networks. IEEE/ACM Trans. Netw. 30, 62–75 (2022)
Ugurlu, O.: ADA-PC: an asynchronous distributed algorithm for minimizing pairwise connectivity in wireless multi-hop networks. Comput. Netw. 227, 109703 (2023)
Imran, M., Younis, M., Md Said, A., Hasbullah, H.: Localized motion-based connectivity restoration algorithms for wireless sensor and actor networks. J. Netw. Comput. Appl. 35, 844–856 (2012)
Dagdeviren, O., Akram, V.K., Tavli, B., Yildiz, H.U., Atilgan, C.: Distributed detection of critical nodes in wireless sensor networks using connected dominating set. IEEE Sens. 2016, 1–3 (2016)
Shukla, S.: Angle based critical nodes detection (ABCND) for reliable industrial wireless sensor networks. Wireless Pers. Commun. 130, 757–775 (2023)
Sun, M.T., Chu, C.H., Wu, E.H.K., Hsiao, C.S.: Efficient articulation point collaborative exploration for reliable communications in wireless sensor networks. IEEE Sens. J. 16, 8578–8588 (2016)
Saoudi, M., et al.: D-LPCN: a distributed least polar-angle connected node algorithm for finding the boundary of a wireless sensor network. Ad Hoc Netw. 56, 56–71 (2017)
Pattanaik, K., Trivedi, A.: A dynamic distributed boundary node detection algorithm for management zone delineation in precision agriculture. J. Netw. Comput. Appl. 167, 102712 (2020)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Liu, Y., Lei, L., Zhang, L. (2024). An Efficient Geometric-Partition-Based Distributed Algorithm for Detecting Critical Nodes in Flying Ad-Hoc Networks. In: Dong, J., Zhang, L., Cheng, D. (eds) Proceedings of the 2nd International Conference on Internet of Things, Communication and Intelligent Technology. IoTCIT 2023. Lecture Notes in Electrical Engineering, vol 1197. Springer, Singapore. https://doi.org/10.1007/978-981-97-2757-5_32
Download citation
DOI: https://doi.org/10.1007/978-981-97-2757-5_32
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-97-2756-8
Online ISBN: 978-981-97-2757-5
eBook Packages: Computer ScienceComputer Science (R0)