Barrier coverage with wireless sensors

Kumar, Santosh; Lai, Ten-Hwang; Arora, Anish

doi:10.1007/s11276-006-9856-0

Cited by 263 publications

(385 citation statements)

References 22 publications

Supporting

Mentioning

381

Contrasting

Order By: Relevance

“…The problem studied in our paper is motivated by securing an area by ensuring its border surveillance and intruder detection with a wireless sensor system. [10] proposes efficient algorithms to determine, after sensor deployment, whether a region is barrier covered. It also establishes optimal deployment patterns to achieve barrier coverage when deploying sensors deterministically.…”

Section: Related Workmentioning

confidence: 99%

On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment

Czyzowicz¹,

Kranakis²,

Kriz̧anc³

et al. 2010

Ad-Hoc, Mobile and Wireless Networks

View full text Add to dashboard Cite

Abstract. A set of sensors establishes barrier coverage of a given line segment if every point of the segment is within the sensing range of a sensor. Given a line segment I, n mobile sensors in arbitrary initial positions on the line (not necessarily inside I) and the sensing ranges of the sensors, we are interested in finding final positions of sensors which establish a barrier coverage of I so that the sum of the distances traveled by all sensors from initial to final positions is minimized. It is shown that the problem is NP complete even to approximate up to constant factor when the sensors may have different sensing ranges. When the sensors have an identical sensing range we give several efficient algorithms to calculate the final destinations so that the sensors either establish a barrier coverage or maximize the coverage of the segment if complete coverage is not feasible while at the same time the sum of the distances traveled by all sensors is minimized. Some open problems are also mentioned.

show abstract

Section: Related Workmentioning

confidence: 99%

On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment

Czyzowicz¹,

Kranakis²,

Kriz̧anc³

et al. 2010

Ad-Hoc, Mobile and Wireless Networks

View full text Add to dashboard Cite

show abstract

“…In [9] efficient algorithms are proposed to determine, after sensor deployment, whether a region is barrier covered. It also establishes optimal deployment patterns to achieve barrier coverage when deploying sensors deterministically.…”

Section: Related Workmentioning

confidence: 99%

On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment

Czyzowicz

Kranakis

Kriz̧anc

et al. 2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the line. An intruder traversing the barrier can be detected only when it is within the sensing range of at least one sensor. The sensor network establishes barrier coverage of the segment if no intruder can penetrate the barrier from any direction in the plane without being detected. Starting from arbitrary initial positions of sensors on the line we are interested in finding final positions of sensors that establish barrier coverage and minimize the maximum distance traversed by any sensor. We distinguish several variants of the problem, based on (a) whether or not the sensors have identical ranges, (b) whether or not complete coverage is possible and (c) in the case when complete coverage is impossible, whether or not the maximal coverage is required to be contiguous. For the case of n sensors with identical range, when complete coverage is impossible, we give linear time optimal algorithms that achieve maximal coverage, both for the contiguous and non-contiguous case. When complete coverage is possible, we give an O(n 2 ) algorithm for an optimal solution, a linear time approximation scheme with approximation factor 2, and a (1 + ) PTAS. When the sensors have unequal ranges we show that a variation of the problem is NP-complete and identify some instances which can be solved with our algorithms for sensors with unequal ranges.

show abstract

“…As explained above, this is due to the fact that when R is a curve symmetry plays a significant role. Before ending this section, we observe that, in case the application scenario is border monitoring, the designer is in general interested at deploying a "barrier" of sensors [7], rather than covering a given (one-or two-dimensional) area. We have performed a set of experiments in which we fixed two points, s and d, as the starting and ending points of the border to monitor, and we built a coverage graph G in which two sensors are directly connected iff their covering circles intersect.…”

Section: Simulation Studymentioning

confidence: 99%

“…With this setting, we have investigated the probability of having s and d connected by a path in G when a certain number of sensors are dropped over the sd line segment. This problem is essentially that of 1-barrier covering an arbitrary, but sufficiently wide, belt region, i.e., a region in which the "east-west" bounding curves are distant enough from the line sd (see [7]). Here, however, we require that the connected path joins two well-defined points (s and d) rather than two arbitrary points along the "north-south" bounding curves of the belt region.…”

Section: Simulation Studymentioning

confidence: 99%

Partially controlled deployment strategies for wireless sensors

2009

View full text Add to dashboard Cite

In this paper we study the following problem: we are given a certain one-or two-dimensional region R to monitor and a requirement on the degree of coverage (DoC) of R to meet by a network of deployed sensors. The latter will be dropped by a moving vehicle, which can release sensors at arbitrary points within R. The node spatial distribution when sensors are dropped at a certain point is modeled by a certain probability density function F . The network designer is allowed to choose an arbitrary set of drop points, and to release an arbitrary number of sensors at each point. Given this setting, we consider the problem of determining the best performing strategy among a certain set of grid-like strategies that reflect the (one-or two-dimensional) symmetry of the region to be monitored. The best performing deployment strategy is such that (1) the DoC requirement is fulfilled and (2) the total number of deployed nodes n is minimum. We study this problem both analytically and through simulation, under the assumption that F is the two-dimensional Normal distribution centered at the drop point. The main contribution of this paper is an in-depth study of the inter-relationships between environmental conditions, DoC requirement, and cost of the deployment.

show abstract

Barrier coverage with wireless sensors

Cited by 263 publications

References 22 publications

On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment

On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment

On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment

Partially controlled deployment strategies for wireless sensors

Contact Info

Product

Resources

About