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

[1]  D. Du,et al.  Radar placement along banks of river , 2012, J. Glob. Optim..

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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