Weak Coverage of a Rectangular Barrier

Assume n wireless mobile sensors are initially dispersed in an ad hoc manner in a rectangular region. Each sensor can monitor a circular area of specific diameter around its position, called the sensor diameter. Sensors are required to move to final locations so that they can there 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 any sensor (MinMax). We give an $$O(n^{3/2})$$ O ( n 3 / 2 ) time algorithm for the MinNum problem for sensors of diameter 1 that are initially placed at integer positions; in contrast the problem is shown to be NP-complete 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)$$ O ( n log n ) time for the Manhattan metric and sensors of identical diameter (homogeneous sensors) in arbitrary initial positions, while it is NP-complete for heterogeneous sensors. Finally, we prove that even very restricted homogeneous versions of the MinMax problem are NP-complete.

[1]  Wenhua Dou,et al.  Strong k-barrier coverage with mobile sensors , 2010, IWCMC.

[2]  Flaminia L. Luccio,et al.  Maintaining Intruder Detection Capability in a Rectangular Domain with Sensors , 2015, ALGOSENSORS.

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

[4]  Marek Karpinski,et al.  Approximation Hardness of Short Symmetric Instances of MAX-3SAT , 2003, Electron. Colloquium Comput. Complex..

[5]  Lata Narayanan,et al.  On Multi-round Sensor Deployment for Barrier Coverage , 2013, 2013 IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems.

[6]  Lata Narayanan,et al.  Minimizing the number of sensors moved on line barriers , 2011, 2011 IEEE Wireless Communications and Networking Conference.

[7]  Jian Li,et al.  Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain , 2012, SWAT.

[8]  Nicola Santoro,et al.  Distributed Barrier Coverage with Relocatable Sensors , 2014, SIROCCO.

[9]  P. Berman,et al.  On Some Tighter Inapproximability Results , 1998, Electron. Colloquium Comput. Complex..

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

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

[12]  Mike Burmester,et al.  Optimal movement of mobile sensors for barrier coverage of a planar region , 2009, Theor. Comput. Sci..

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

[14]  Lata Narayanan,et al.  Weak Coverage of a Rectangular Barrier , 2017, CIAC.

[15]  Daji Qiao,et al.  Multi-Round Sensor Deployment for Guaranteed Barrier Coverage , 2010, 2010 Proceedings IEEE INFOCOM.

[16]  Haitao Wang,et al.  Minimizing the Aggregate Movements for Interval Coverage , 2016, Algorithmica.

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

[18]  Jorge Urrutia,et al.  Complexity of Barrier Coverage with Relocatable Sensors in the Plane , 2013, CIAC.

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

[20]  Lata Narayanan,et al.  Distributed algorithms for barrier coverage using relocatable sensors , 2016, Distributed Computing.

[21]  Xiaojun Shen,et al.  A study on the weak barrier coverage problem in wireless sensor networks , 2011, Comput. Networks.

[22]  Habib Mostafaei,et al.  Stochastic barrier coverage in wireless sensor networks based on distributed learning automata , 2015, Comput. Commun..

[23]  Ivan Stojmenovic,et al.  Strictly Localized Sensor Self-Deployment for Optimal Focused Coverage , 2011, IEEE Transactions on Mobile Computing.

[24]  Marek Karpinski,et al.  On Some Tighter Inapproximability Results (Extended Abstract) , 1999, ICALP.