Research Article
A Distributed Algorithm for Constructing Underwater Strong k-Barrier Coverage
@INPROCEEDINGS{10.1007/978-3-030-14657-3_18, author={Weiqiang Shen and Chuanlin Zhang and Jinglun Shi and Xiaona Zhang and Zhihong Wang}, title={A Distributed Algorithm for Constructing Underwater Strong 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={Wireless sensor networks Underwater wireless sensor networks Underwater sensor barrier coverage Three-dimensional underwater strong k-barrier coverage}, doi={10.1007/978-3-030-14657-3_18} }
- Weiqiang Shen
Chuanlin Zhang
Jinglun Shi
Xiaona Zhang
Zhihong Wang
Year: 2019
A Distributed Algorithm for Constructing Underwater Strong k-Barrier Coverage
IOTAAS
Springer
DOI: 10.1007/978-3-030-14657-3_18
Abstract
Sensor barrier coverage has been recognized as an appropriate coverage model for intrusion detection, and many achievements have been obtained in two-dimensional (2D) terrestrial wireless sensor networks. However, the achievements based on 2D assumption cannot be directly applied in three-dimensional (3D) application scenarios, e.g., underwater wireless sensor networks. In this paper, we aim to devise a distributed algorithm for constructing maximum level underwater strong k-barrier coverage with mobile sensors in 3D underwater environment. Considering that an underwater strong k-barrier coverage is constituted with k underwater strong 1-barrier coverage which is referred to as layer in this work, we first derive the optimal positions of the sensors in each layer, then we propose a distributed algorithm for constructing maximum level underwater strong k-barrier coverage with available mobile sensors layer by layer from left to right in 3D underwater environment. Simulation results show that the proposed algorithm outperforms the optimal centralized approach (i.e., Hungarian algorithm) in terms of duration and achieves performance close to Hungarian algorithm with respect to several performance metrics.