Abstract
Underwater sensor networks based barrier coverage is increasingly important for intrusion detection due to the scarcity of underwater sensor resource. To improve UWSNs’ detection performance and prolong their lifetime, an efficient barrier coverage strategy is very important. In this paper, a novel concept: hierarchy graph is proposed. Hierarchy graph can make the network’s topology more clarity. In accordance with the hierarchy graph, 1-barrier coverage algorithm and k-barrier coverage algorithm are presented to construct the barrier with less sensors for higher energy efficiency. Both analytical and simulation studies demonstrate that the proposed algorithms can provide high detection probability and long lifetime for UWSNs.
Highlights
Advances of underwater sensor networks (UWSNs) in providing unprecedented capabilities for surveillance monitoring have motivated the deployment of Underwater sensor networks (UWSNs) for a broad range of applications such as oceanographic data collection, environmental and pollution monitoring [1], disaster prevention, assisted navigation, intrusion detection [2] and border monitoring [3]
N sensors are randomly deployed in the UWSN following a uniform distribution in a belt region of 10,000 × 500 m2
The detection probability of the system using the proposed k-MNHG algorithm can reach 95%, when SL = 145 dB and N = 80 sensors are randomly deployed in the belt region, which proves that the barrier coverage strategy based on a hierarchy graph is more suitable for UWSNs
Summary
Advances of underwater sensor networks (UWSNs) in providing unprecedented capabilities for surveillance monitoring have motivated the deployment of UWSNs for a broad range of applications such as oceanographic data collection, environmental and pollution monitoring [1], disaster prevention, assisted navigation, intrusion detection [2] and border monitoring [3]. In [8], a cluster-based directional barrier graph is proposed to model the barrier coverage formation problem and a greedy movement algorithm for heterogeneous wireless sensor networks (WSNs) is derived to efficiently schedule different types of mobile sensors to different gaps while minimizing the total moving cost. In [17], an effective algorithm is proposed to construct barriers with low message complexity to preserve the energy in each node and with minimum cost to extend the lifetime of the wireless sensor network. In order to take account of energy efficiency and detection performance simultaneously, we need to focus on constructing barriers with a minimum number of sensors. We study the barrier coverage strategy in random deployment with a minimum number of stationary sensors.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
