We consider several variations of the problems of covering a set of barriers (modeled as line segments) using sensors that can detect any intruder crossing any of the barriers. Sensors are initially located in the plane and they can relocate to the barriers. We assume that each sensor can detect any intruder in a circular area of fixed range centered at the sensor. Given a set of barriers and a set of sensors located in the plane, we study three problems: (i) the feasibility of barrier coverage, (ii) the problem of minimizing the largest relocation distance of a sensor (MinMax), and (iii) the problem of minimizing the sum of relocation distances of sensors (MinSum). When sensors are permitted to move to arbitrary positions on the barrier, the MinMax problem is shown to be strongly NP-complete for sensors with arbitrary ranges. We also study the case when sensors are restricted to use perpendicular movement to one of the barriers. We show that when the barriers are parallel, both the MinMax and MinSum problems can be solved in polynomial time. In contrast, we show that even the feasibility problem is strongly NP-complete if two perpendicular barriers are to be covered, even if the sensors are located at integer positions, and have only two possible sensing ranges. On the other hand, we give an O(n3/2) algorithm for a natural special case of this last problem.

Additional Metadata
Keywords Algorithmic complexity, Barrier coverage, Mobile sensors, NP-completeness, Sensor network
Persistent URL dx.doi.org/10.1016/j.tcs.2015.02.006
Journal Theoretical Computer Science
Dobrev, S. (Stefan), Durocher, S. (Stephane), Eftekhari, M. (Mohsen), Georgiou, K. (Konstantinos), Kranakis, E, Krizanc, D. (Danny), … Urrutia, J. (Jorge). (2015). Complexity of barrier coverage with relocatable sensors in the plane. Theoretical Computer Science, 579, 64–73. doi:10.1016/j.tcs.2015.02.006