Research Article
Constructing Underwater Weak k-Barrier Coverage
@INPROCEEDINGS{10.1007/978-3-030-14657-3_19, author={Weiqiang Shen and Chuanlin Zhang and Jinglun Shi and Ruiyan Han}, title={Constructing Underwater Weak k-Barrier Coverage}, proceedings={IoT as a Service. 4th EAI International Conference, IoTaaS 2018, Xi’an, China, November 17--18, 2018, Proceedings}, proceedings_a={IOTAAS}, year={2019}, month={3}, keywords={Underwater wireless sensor networks Barrier coverage Underwater weak k-barrier coverage 3D sensor barrier}, doi={10.1007/978-3-030-14657-3_19} }- Weiqiang Shen
Chuanlin Zhang
Jinglun Shi
Ruiyan Han
Year: 2019
Constructing Underwater Weak k-Barrier Coverage
IOTAAS
Springer
DOI: 10.1007/978-3-030-14657-3_19
Abstract
Most achievements on barrier coverage are based on an assumption that the sensors composing the barrier coverage are finally connected as a two-dimensional (2D) terrestrial wireless sensor network, where a barrier is a chain of sensors from one end of the deployment region to the other end with overlapping sensing zones of adjacent sensors. However, the 2D assumption cannot directly be applied in three-dimensional (3D) application scenarios, e.g., underwater wireless sensor networks, where sensors are finally distributed over 3D underwater environment. In this paper, we investigate weak k-barrier coverage problem in underwater wireless sensor networks. We first analyse how to construct 3D underwater weak k-barrier coverage with minimum sensors, then we propose a parallel movement manner, based on which an effective algorithm is proposed for constructing weak k-barrier coverage with minimum sensors while minimizing the total movement distance of all sensors in underwater wireless sensor networks. Extensive simulation results validate the correctness of our analysis, and show that the proposed algorithm outperforms the GreedyMatch algorithm.