Distributed algorithms for barrier coverage using relocatable sensors

Eftekhari, Mohsen; Kranakis, Evangelos; Kriz̧anc, Danny; Morales-Ponce, Oscar; Narayanan, Lata; Opatrný, Jaroslav; Shende, Sunil

doi:10.1007/s00446-016-0267-x

Cited by 16 publications

(23 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…All these approaches are centralized. Distributed approaches to barrier coverage formation are addressed in [12], [13], [9], [10], [16]. Kong et al [12] used the concept of virtual forces to solve the kbarrier coverage.…”

Section: Related Workmentioning

confidence: 99%

Non-linear barrier coverage using mobile wireless sensors

Baheti

Gupta

2017

2017 IEEE Symposium on Computers and Communications (ISCC)

View full text Add to dashboard Cite

Abstract-A belt region is said to be k-barrier covered by a set of sensors if all paths crossing the width of the belt region intersect the sensing regions of at least k sensors. Barrier coverage can be achieved from a random initial deployment of mobile sensors by suitably relocating the sensors to form a barrier. Reducing the movement of the sensors is important in such scenarios due to the energy constraints of sensor devices. In this paper, we propose a centralized algorithm which achieves 1-barrier coverage by forming a non-linear barrier from a random initial deployment of sensors in a belt. The algorithm uses a novel idea of physical behavior of chains along with the concept of virtual force. Formation of non-linear barrier reduces the movement of the sensors needed as compared to linear barriers. Detailed simulation results are presented to show that the proposed algorithm achieves barrier coverage with less movement of sensors compared to other existing algorithms in the literature.

show abstract

Section: Related Workmentioning

confidence: 99%

Non-linear barrier coverage using mobile wireless sensors

Baheti

Gupta

2017

2017 IEEE Symposium on Computers and Communications (ISCC)

View full text Add to dashboard Cite

show abstract

“…A stochastic optimization algorithm was considered in [15]. Distributed algorithms for the barrier coverage problem were studied in [11,12]. Further, [16] provides algorithms for deciding if a set of sensors provides k-fault tolerant protection against rectilinear attacks in both one and two dimensions.…”

Section: Related Workmentioning

confidence: 99%

Weak Coverage of a Rectangular Barrier

Dobrev

Kranakis

Kriz̧anc

et al. 2017

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Assume n wireless mobile sensors are initially dispersed in an ad hoc manner in a rectangular region. They are required to move to final locations so that they can detect any intruder crossing the region in a direction parallel to the sides of the rectangle, and thus provide weak barrier coverage of the region. We study three optimization problems related to the movement of sensors to achieve weak barrier coverage: minimizing the number of sensors moved (MinNum), minimizing the average distance moved by the sensors (MinSum), and minimizing the maximum distance moved by the sensors (MinMax). We give an O(n 3/2 ) time algorithm for the MinNum problem for sensors of diameter 1 that are initially placed at integer positions; in contrast we show that the problem is NP-hard even for sensors of diameter 2 that are initially placed at integer positions. We show that the MinSum problem is solvable in O(n log n) time for homogeneous range sensors in arbitrary initial positions for the Manhattan metric, while it is NP-hard for heterogeneous sensor ranges for both Euclidean and Manhattan metrics. Finally, we prove that even very restricted homogeneous versions of the MinMax problem are NP-hard.

show abstract

“…Clearly, when the sensor dispersal on the barrier is random then coverage depends on the sensor density and some authors have proposed using several rounds of random dispersal for complete barrier coverage [9,18]. Another approach is to have the sensors relocate from their initial position to a new position on the barrier so as to achieve complete coverage [5,6,8,16]. Further, this relocation may be done in a centralized (cf.…”

Section: Related Workmentioning

confidence: 99%

On the displacement for covering a d-dimensional cube with randomly placed sensors

Kapelko

Kranakis

2016

Ad Hoc Networks

Self Cite

View full text Add to dashboard Cite

Consider n sensors placed randomly and independently with the uniform distribution in a d−dimensional unit cube (d ≥ 2). The sensors have identical sensing range equal to r, for some r > 0. We are interested in moving the sensors from their initial positions to new positions so as to ensure that the d−dimensional unit cube is completely covered, i.e., every point in the d−dimensional cube is within the range of a sensor. If the i-th sensor is displaced a distance d i , what is a displacement of minimum cost? As cost measure for the displacement of the team of sensors we consider the a-total movement defined as the sum, for some constant a > 0. We assume that r and n are chosen so as to allow full coverage of the d−dimensional unit cube and a > 0.The main contribution of the paper is to show the existence of a tradeoff between the d−dimensional cube, sensing radius and a-total movement. The main results can be summarized as follows for the case of the d−dimensional cube. If the d−dimensional cube sensing radius is

show abstract

Distributed algorithms for barrier coverage using relocatable sensors

Cited by 16 publications

References 26 publications

Non-linear barrier coverage using mobile wireless sensors

Non-linear barrier coverage using mobile wireless sensors

Weak Coverage of a Rectangular Barrier

On the displacement for covering a d-dimensional cube with randomly placed sensors

Contact Info

Product

Resources

About