Minimizing the maximum sensor movement for barrier coverage in the plane

Li, Shuangjuan; Shen, Hong

doi:10.1109/infocom.2015.7218388

Cited by 44 publications

(35 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By examining the correlations and sensitivity from the system parameters, they derived the minimum number of mobile sensors that needs to be deployed in order to maintain the k-barrier coverage for a mobile sensor network. The algorithm proposed in Li and Shen 16 computed a permutation of the left and right endpoints of the moving ranges of all the sensors forming a barrier coverage and minimized the maximum sensor movement distance by characterizing permutation switches that are critical. Tian et al 17 studied the barrier coverage problem in a mobile survivability heterogeneous wireless sensor network, which is composed of sensor nodes with environmental survivability to make them robust to environmental conditions and with motion capabilities to repair the barrier when sensors are dead.…”

Section: Related Workmentioning

confidence: 99%

Strong barrier coverage of directional sensor networks with mobile sensors

Zhao

Bai

Shen

et al. 2018

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

Strong barrier coverage of directional sensor networks with mobile sensors

Zhao

Bai

Shen

et al. 2018

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…One of the most important applications in mobile wireless sensor networks is to monitor a barrier to detect intruders in an attempt to cross a specific region. Barrier coverage [14,16], which guarantees that every movement crossing a barrier of sensors will be detected, is known to be an appropriate model of coverage for such applications. Mobile sensors normally have limited battery power and therefore their movements should be as small as possible.…”

Section: Related Workmentioning

confidence: 99%

Algorithms for Covering Multiple Barriers

Wang

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper, we consider the problems for covering multiple intervals on a line. Given a set B of m line segments (called "barriers") on a horizontal line L and another set S of n horizontal line segments of the same length in the plane, we want to move all segments of S to L so that their union covers all barriers and the maximum movement of all segments of S is minimized. Previously, an O(n 3 log n)-time algorithm was given for the case m = 1. In this paper, we propose an O(n 2 log n log log n + nm log m)-time algorithm for a more general setting with any m ≥ 1, which also improves the previous work when m = 1. We then consider a line-constrained version of the problem in which the segments of S are all initially on the line L. Previously, an O(n log n)-time algorithm was known for the case m = 1. We present an algorithm of O(m log m + n log m log n) time for any m ≥ 1. These problems may have applications in mobile sensor barrier coverage in wireless sensor networks.

show abstract

“…As an important problem in WSNs, barrier coverage is garnering more and more attention in recent years. [1][2][3][4][5] Compared with the area coverage problem, barrier coverage does not necessarily cover every point of the monitored region, but rather only needs to detect intruders that cross the border. 4 Therefore, it is more cost-efficient for large-scale deployment of wireless sensors and has been widely employed in practical security-related applications, for example, international border surveillance, intrusion detection, and critical infrastructure protection.…”

Section: Introductionmentioning

confidence: 99%

A fully distributed deployment algorithm for underwater strong k-barrier coverage using mobile sensors

Shen

Zhang

et al. 2019

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Sensor barrier coverage has been recognized as an appropriate coverage model for intrusion detection, and many achievements have been obtained in two-dimensional terrestrial wireless sensor networks. However, the achievements based on two-dimensional assumption cannot be directly applied in three-dimensional application scenarios, for example, underwater wireless sensor networks. In this article, we aim to devise a fully distributed deployment algorithm for constructing maximum-level underwater strong k-barrier coverage with available mobile sensors in underwater environment to satisfy the requirement of underwater security-related applications. We first analyze how to form underwater strong one-barrier coverage with minimum mobile sensors, based on which we obtain the minimum number of sensors required for constructing underwater strong one-barrier coverage and the corresponding optimal final positions of these sensors. Then, we propose a fully distributed deployment algorithm for constructing maximum-level underwater strong k-barrier coverage with available mobile sensors in three-dimensional underwater environment. We show that the proposed algorithm has a guaranteed termination after a finite time and is able to self-heal the underwater strong k-barrier coverage to deal with sudden sensor failures. Experimental results validate our analysis and show that the proposed algorithm outperforms both Hungarian and HungarianK in terms of duration and achieves performance close to them with respect to several performance metrics.

show abstract

Minimizing the maximum sensor movement for barrier coverage in the plane

Cited by 44 publications

References 15 publications

Strong barrier coverage of directional sensor networks with mobile sensors

Strong barrier coverage of directional sensor networks with mobile sensors

Algorithms for Covering Multiple Barriers

A fully distributed deployment algorithm for underwater strong k-barrier coverage using mobile sensors

Contact Info

Product

Resources

About