Barrier Coverage Problem in 2D

Erzin, Adil; Lagutkina, Natalya

doi:10.1007/978-3-030-14094-6_8

Cited by 7 publications

(6 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Cherry et al 10 studied the 2D Min‐Sum barrier coverage problem where the initial positions of sensors are on the plane and proposed an O ( n 4 ) runtime approximation algorithm with

\sqrt{2}

approximation ratio. Later, Erzin and Lagutkina 11 designed another approximation algorithm improving the time complexity to O ( n 2 ) while retaining the same approximation ratio. For the coverage of k parallel barriers, Cherry et al 10 also proposed an approximation algorithm with the same approximation ratio

\sqrt{2}

but suffering a high runtime of O ( kn 2 k + 2 ).…”

Section: Introductionmentioning

confidence: 99%

Linear time algorithm for computing min‐max movement of sink‐based mobile sensors for line barrier coverage

Zou

Guo

Huang

et al. 2020

Concurrency and Computation

View full text Add to dashboard Cite

Witnessing broad energy‐critical applications of barrier coverage in mobile and wireless sensor networks, emerging practical applications have recently brought a new barrier coverage model which uses sink‐based mobile sensors for covering a given barrier with the aim of prolonging the lifespan of the coverage. In the model, a set of sink stations were distributed on the plane in which each sink can emit mobile sensors with an identical radius. The task is to cover a given line barrier with the emitted mobile sensors, aiming to minimize the maximum movement of the sensors so as to prolong the shortest lifespan among the sensors in coverage. In this paper, we first devise an algorithm for optimally solving the problem based on the properties of the structures called movement parity and tangent equilibrium points between the sinks. Then based on a more sophisticated geometric property of optimum solutions, we improve the runtime to a linear runtime O(k) which attains the possibly optimum runtime of the problem for k being the number of sinks. At last, numerical experiments are carried out to demonstrate the practical performance gain of our algorithms against baselines in literature.

show abstract

“…Cherry et al 10 studied the 2D Min‐Sum barrier coverage problem where the initial positions of sensors are on the plane and proposed an O ( n 4 ) runtime approximation algorithm with

\sqrt{2}

\sqrt{2}

but suffering a high runtime of O ( kn 2 k + 2 ).…”

Section: Introductionmentioning

confidence: 99%

Linear time algorithm for computing min‐max movement of sink‐based mobile sensors for line barrier coverage

Zou

Guo

Huang

et al. 2020

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…Monitoring can be carried out using both stationary [7,8,13,16,17,18] and mobile sensors [2,3,4,5,6,9,10,11,13,14,15]. The problem of energy efficient covering a segment with stationary sensors with adjustable circular sensing areas initially located on a segment is considered in [13,17].…”

Section: Introductionmentioning

confidence: 99%

“…If the sensor is mobile, then the moving energy consumption is directly proportional to the length of the path traveled. In this case, the problem of barrier monitoring by mobile sensors with circular coverage areas is to move the sensors so that each barrier point is in the coverage area of at least one sensor, and the total length of the movement paths of the sensors involved in the covering is minimal [11]. This problem is usually denoted as MinSum [9].…”

Section: Introductionmentioning

confidence: 99%

“…The first class is a one-dimensional (1D) problem, when the sensors are initially on the line containing the segment to be covered [2,3,4,6,10,13,15]. In the two-dimensional (2D) case, the problem is considered when the sensors are arbitrarily located on the plane [5,9,11]. In [10] it is proved that even for the one-dimensional case when the radii of the circles are different, the MinSum problem is NP-hard.…”

Section: Introductionmentioning

confidence: 99%

“…This solution has the property of preserving the order when the initial order of the circles involved in the covering after moving to the barrier does not change. This result was improved in [11], where an algorithm for constructing an order preserving cover (OPC) was proposed, having the complexity O(n 2 ).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

FPTAS for barrier covering problem with equal circles in 2D

Erzin,

Lagutkina

2018

Preprint

Self Cite

View full text Add to dashboard Cite

In this paper, we consider a problem of covering a straight line segment by equal circles that are initially arbitrarily placed on a plane by moving their centers on a segment or on a straight line containing a segment so that the segment is completely covered, the neighboring circles in the cover are touching each other and the total length of the paths traveled by circles is minimal. The complexity status of the problem is not known. We propose a O(n 2+c /ε 2 )-time FPTAS for this problem, where n is the number of circles and c > 0 is arbitrarily small real.

show abstract

Distance-Constrained Line Routing Problem

Erzin

Plotnikov

2020

Communications in Computer and Information Science

View full text Add to dashboard Cite

Barrier Coverage Problem in 2D

Cited by 7 publications

References 24 publications

Linear time algorithm for computing min‐max movement of sink‐based mobile sensors for line barrier coverage

Linear time algorithm for computing min‐max movement of sink‐based mobile sensors for line barrier coverage

FPTAS for barrier covering problem with equal circles in 2D

Distance-Constrained Line Routing Problem

Contact Info

Product

Resources

About