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

The coverage problem in wireless sensor networks 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 lengths of the line segments are bounded within a constant factor of the sensing radius of each sensor. Finally, we propose a constant factor approximation algorithm for k-covering axis-parallel line segments such that sensors maintain a minimum separation among them.

[1]  C. Siva Ram Murthy,et al.  Dynamic Coverage Maintenance Algorithms for Sensor Networks with Limited Mobility , 2005, Third IEEE International Conference on Pervasive Computing and Communications.

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

[3]  Bin Ma,et al.  Sensor networks deployment using flip-based sensors , 2005, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005..

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

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

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

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

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

[9]  Thomas F. La Porta,et al.  Bidding Protocols for Deploying Mobile Sensors , 2007, IEEE Transactions on Mobile Computing.

[10]  Ioannis G. Tollis,et al.  Planar grid embedding in linear time , 1989 .

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

[12]  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.

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

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

[15]  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).

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

[17]  Xiangke Liao,et al.  Barrier Coverage with Mobile Sensors , 2008, 2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008).

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

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

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

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

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

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

[24]  Yeh-Ching Chung,et al.  A Delaunay Triangulation based method for wireless sensor network deployment , 2007, Comput. Commun..

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

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

[27]  Luérbio Faria,et al.  On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation , 2004, Electron. Notes Discret. Math..

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

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

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

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

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

[33]  Xiaojiang Du,et al.  Improving coverage performance in sensor networks by using mobile sensors , 2005, MILCOM 2005 - 2005 IEEE Military Communications Conference.

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

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

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

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