Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks

The coverage problem in wireless sensor network deals with the problem of covering a region or parts of it with sensors. In this paper, we address the problem of covering a set of line segments with minimum number of sensors. A line segment ℓ is said to be 1-covered if it intersects the sensing region of at least one among the sensors distributed in a bounded rectangular region R. We assume that the sensing radius of each sensor is uniform. The problem of finding the minimum number of sensors needed to 1-cover each member in a given set of line segments in R is NP-hard. We propose two constant factor approximation algorithms and a PTAS (Polynomial Time Approximation Scheme) for the problem for 1-covering a set of axis-parallel line segments. We also show that a PTAS exists for 1-covering a set of arbitrarily oriented line segments in R where the length of the line segments are bounded within a constant factor of the sensing radius of each sensor.

[1]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration for energy conservation in sensor networks , 2005, TOSN.

[2]  Alessandro Agnetis,et al.  Covering a line segment with variable radius discs , 2007, Comput. Oper. Res..

[3]  D. Manjunath,et al.  On the Path Coverage Properties of Random Sensor Networks , 2007, IEEE Transactions on Mobile Computing.

[4]  Matthew J. Katz,et al.  Covering Points by Unit Disks of Fixed Location , 2007, ISAAC.

[5]  Miodrag Potkonjak,et al.  Worst and best-case coverage in sensor networks , 2005, IEEE Transactions on Mobile Computing.

[6]  Biswanath Mukherjee,et al.  Optimizing placement of beacons and data loggers in a sensor network - a case study , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[7]  Silvia Ferrari,et al.  A Geometric Transversal Approach to Analyzing Track Coverage in Sensor Networks , 2008, IEEE Transactions on Computers.

[8]  Dong Xuan,et al.  On Deploying Wireless Sensors to Achieve Both Coverage and Connectivity , 2006, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing.

[9]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[10]  Heribert Vollmer,et al.  A polynomial-time approximation scheme for base station positioning in UMTS networks , 2001, DIALM '01.

[11]  Hai Liu,et al.  Maximal lifetime scheduling for K to 1 sensor-target surveillance networks , 2006, Comput. Networks.

[12]  Parameswaran Ramanathan,et al.  Sensor deployment strategy for target detection , 2002, WSNA '02.

[13]  Matthew J. Katz,et al.  Polynomial-time approximation schemes for piercing and covering with applications in wireless networks , 2008, Comput. Geom..

[14]  Zhao Zhang,et al.  Radar placement along banks of river , 2012, J. Glob. Optim..

[15]  Teofilo F. Gonzalez,et al.  Covering a Set of Points in Multidimensional Space , 1991, Inf. Process. Lett..

[16]  Shigeo Shioda,et al.  Path coverage properties of randomly deployed sensors with finite data-transmission ranges , 2009, Comput. Networks.

[17]  Arobinda Gupta,et al.  Approximation Algorithm for Line Segment Coverage for Wireless Sensor Network , 2010, ArXiv.

[18]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2005, Mob. Networks Appl..

[19]  Stephane Durocher,et al.  An Improved Line-Separable Algorithm for Discrete Unit Disk Cover , 2010, Discret. Math. Algorithms Appl..

[20]  Yeh-Ching Chung,et al.  A Delaunay triangulation based method for wireless sensor network deployment , 2006, 12th International Conference on Parallel and Distributed Systems - (ICPADS'06).

[21]  Prasun Sinha,et al.  Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks , 2009, IEEE INFOCOM 2009.

[22]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.

[23]  Timothy M. Chan.  Polynomial-time approximation schemes for packing and piercing fat objects , 2003, J. Algorithms.

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

[25]  Xiaohua Jia,et al.  Coverage problems in wireless sensor networks: designs and analysis , 2008, Int. J. Sens. Networks.

[26]  Timothy M. Chan,et al.  Approximating the piercing number for unit-height rectangles , 2005, CCCG.

[27]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[28]  Chang-Gun Lee,et al.  Sensor Placement for 3-Coverage with Minimum Separation Requirements , 2008, DCOSS.

[29]  Arun K. Pujari,et al.  Q-Coverage Problem in Wireless Sensor Networks , 2009, ICDCN.

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

[31]  Arobinda Gupta,et al.  Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks , 2013, Wirel. Networks.

[32]  Sartaj Sahni,et al.  Approximation Algorithms for Sensor Deployment , 2007, IEEE Transactions on Computers.

[33]  Indranil Sengupta,et al.  Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms , 2007, ALGOSENSORS.

[34]  Mark de Berg,et al.  Computational Geometry: Algorithms and Applications, Second Edition , 2000 .

[35]  S. Sitharama Iyengar,et al.  Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks , 2002, IEEE Trans. Computers.