Home /Research /A Coverage-Aware Distributed <i>k</i>-Connectivity Maintenance Algorithm for Arbitrarily Large <i>k</i> in Mobile Sensor Networks
OTHER

A Coverage-Aware Distributed <i>k</i>-Connectivity Maintenance Algorithm for Arbitrarily Large <i>k</i> in Mobile Sensor Networks

Vahid Khalilpour Akram, Orhan Dağdevıren, Bülent Tavlı

Year
2021
Citations
28

Abstract

Mobile sensor networks (MSNs) have emerged from the interaction between mobile robotics and wireless sensor networks. MSNs can be deployed in harsh environments, where failures in some nodes can partition MSNs into disconnected network segments or reduce the coverage area. A <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> -connected network can tolerate at least <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> -1 arbitrary node failures without losing its connectivity. In this study, we present a coverage-aware distributed <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> -connectivity maintenance (restoration) algorithm that generates minimum-cost movements of active nodes after a node failure to preserve a persistent <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> value subject to a coverage conservation criterion. The algorithm accepts a coverage conservation ratio (as a trade-off parameter between coverage and movements) and facilitates coverage with the generated movements according to this value. Extensive simulations and testbed experiments reveal that the proposed algorithm restores <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> -connectivity more efficiently than the existing restoration algorithms. Furthermore, our algorithm can be utilized to maintain <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> -connectivity without sacrificing the coverage, significantly.

Keywords

AlgorithmNotationComputer scienceNode (physics)TestbedWireless sensor networkArtificial intelligenceDiscrete mathematicsMathematicsComputer network

Related papers

Browse all OTHER papers