Minimizing the number of sensors moved on line barriers

We study the problem of achieving maximum barrier coverage by sensors on a barrier modeled by a line segment, by moving the minimum possible number of sensors, initially placed at arbitrary positions on the line containing the barrier. We consider several cases based on whether or not complete coverage is possible, and whether non-contiguous coverage is allowed in the case when complete coverage is impossible. When the sensors have unequal transmission ranges, we show that the problem of finding a minimum-sized subset of sensors to move in order to achieve maximum contiguous or non-contiguous coverage on a finite line segment barrier is NP-complete. In contrast, if the sensors all have the same range, we give efficient algorithms to achieve maximum contiguous as well as non-contiguous coverage. For some cases, we reduce the problem to finding a maximum-hop path of a certain minimum (maximum) weight on a related graph, and solve it using dynamic programming.

[1]  Jorge Urrutia,et al.  On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment , 2010, ADHOC-NOW.

[2]  Ai Chen,et al.  Designing localized algorithms for barrier coverage , 2007, MobiCom '07.

[3]  Gaurav S. Sukhatme,et al.  Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .

[4]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[5]  Morteza Zadimoghaddam,et al.  Minimizing movement , 2007, SODA '07.

[6]  Mike Burmester,et al.  Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region , 2008, COCOA.

[7]  Thomas F. La Porta,et al.  Movement-Assisted Sensor Deployment , 2006, IEEE Trans. Mob. Comput..

[8]  Y. Ebihara.  Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[9]  Béla Bollobás,et al.  Reliable density estimates for coverage and connectivity in thin strips of finite length , 2007, MobiCom '07.

[10]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[11]  Donald F. Towsley,et al.  Mobility improves coverage of sensor networks , 2005, MobiHoc '05.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  József Balogh,et al.  On k-coverage in a mostly sleeping sensor network , 2004, MobiCom '04.

[14]  Anish Arora,et al.  Barrier coverage with wireless sensors , 2005, MobiCom '05.

[15]  Jorge Urrutia,et al.  On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment , 2010, ADHOC-NOW.