Strong barrier coverage of directional sensor networks with mobile sensors

Abstract

Barrier coverage is attractive for many practical applications of directional sensor networks. Power conservation is one of the important issues in directional sensor networks. In this article, we address energy-efficient barrier coverage for directional sensor networks with mobile sensors. First, we derive the critical condition for mobile deployment. We assume that a number of stationary directional sensors are placed independently and randomly following a Poisson point process in a two-dimensional rectangular area. Our analysis shows that the critical condition only depends on the deployment density (l) and the sensing radius (r). When the initial deployment satisfies l\8ln2=r^2, barrier gaps may exist, so we need to redeploy mobile sensors to improve the barrier coverage. Then, we propose an energy-efficient barrier repair algorithm to construct an energy-efficient barrier to detect intruders moving along restricted crossing paths in the target area. Through extensive simulations, the results show that the energy-efficient barrier repair algorithm improves the barrier coverage and prolongs the network lifetime by minimizing the maximum sensor moving distance. And in comparison with the energy-efficient barrier coverage algorithm (previous works), the energy-efficient barrier repair algorithm increases by 18% of network lifetime on average.

Directional-Sensor Network Deployment Planning for Mobile-Target Search

“…Thus, as a benchmark, herein, our proposed strategy was compared against three common deployment methods: (a) uniform [82], (b) random [83,84], and (c) a 'ring of fire' type deployment, which is inspired by the expected topology in a border surveillance application, where search resources are arranged to form a single, air-tight, barrier around a point of interest (i.e., the LKP) [53][54][55][56].…”

“…Solutions to this problem, however, are not directly applicable to target detection since they assume that the target's initial position is an a priori known, which is not the case during target detection. In barrier coverage [53][54][55][56], the problems addressed are a subset of the preferential coverage problem, where sensors are deployed to create a barrier between two RoIs. However, these, typically, consider sensor deployment within a bounded RoI.…”

Hierarchy Graph Based Barrier Coverage Strategy with a Minimum Number of Sensors for Underwater Sensor Networks

“…In order to reduce the power consumption, quite a few works give attention to adopt mobile sensors to fill in barrier gaps with minimum moving cost [7,8,9,10,11,12]. In [7], the critical condition is derived to estimate whether barrier gaps may exist. An energy-efficient barrier repair algorithm is proposed to minimize the maximum sensor moving distance with mobile sensors.…”

k-barrier coverage reliability evaluation for wireless sensor networks using two-dimensional k-within-consecutive-r × s-out-of-m × n:F system

“…With the development of mobile sensor nodes, such nodes can be used to improve the quality of barrier coverage and reduce the costs of sensor node deployment. Zhao et al 8 address the problem of barrier coverage for directional sensor networks with mobile sensors and derive a critical condition that only depends on the deployment density ( λ ) and the sensing radius ( r ). When the initial deployment satisfies λ < 8 ln 2/ r 2 , barrier gaps may exist, and so mobile sensors need to be redeployed to improve the barrier coverage.…”