Designing localized algorithms for barrier coverage

Ai, Chen; Kumar, Santosh; Lai, Ten-Hwang

doi:10.1145/1287853.1287862

Cited by 222 publications

(137 citation statements)

References 13 publications

Supporting

Mentioning

136

Contrasting

Unclassified

Order By: Relevance

“…We consider a default sensing range of R s i = 30 m for all of the sensors [31]. A two-ray ground path loss model with γ = 4 and g 0 = 8.1 ·10 −3 [32] is considered.…”

Section: Simulation Environmentmentioning

confidence: 99%

An Optimization Framework for Resource Allocation in Virtual Sensor Networks

Delgado

Gállego

Canales

et al. 2015

2015 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

Abstract-We propose an optimization framework to perform resource allocation in virtual sensor networks. Sensor network virtualization is a promising paradigm to improve flexibility of wireless sensor networks which allows to dynamically assign physical resources to multiple stakeholder applications. The proposed optimization framework aims at maximizing the total number of applications which can share a common physical network, while accounting for the distinguishing characteristics and limitations of the wireless sensor environment (limited storage, limited processing power, limited bandwidth, tight energy consumption requirements). The proposed framework is finally applied to realistic network topologies to assess the gain involved in letting multiple applications share a common physical network with respect to one-application, one-network vertical design approaches.

show abstract

“…We consider a default sensing range of R s i = 30 m for all of the sensors [31]. A two-ray ground path loss model with γ = 4 and g 0 = 8.1 ·10 −3 [32] is considered.…”

Section: Simulation Environmentmentioning

confidence: 99%

An Optimization Framework for Resource Allocation in Virtual Sensor Networks

Delgado

Gállego

Canales

et al. 2015

2015 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

show abstract

“…In addition, they consider barrier coverage with high probability when sensors are deployed randomly. In [4] the problem of local barrier coverage is introduced and it is shown that it is possible for individual sensors to locally determine the existence of local barrier coverage, even when the region of deployment is arbitrarily curved. Techniques for deriving density estimates for achieving barrier coverage and connectivity in thin strips are introduced in [1], where sensors are deployed as a barrier to detect moving objects and events.…”

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

“…In addition, they consider barrier coverage with high probability when sensors are deployed randomly. The problem of local barrier coverage is introduced in [4]. It shows that it is possible for individual sensors to locally determine the existence of local barrier coverage, even when the region of deployment is arbitrarily curved.…”

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

Designing localized algorithms for barrier coverage

Cited by 222 publications

References 13 publications

An Optimization Framework for Resource Allocation in Virtual Sensor Networks

An Optimization Framework for Resource Allocation in Virtual Sensor Networks

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

Contact Info

Product

Resources

About