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

2012 4th International Conference on Communication Systems and Networks, COMSNETS 2012

Volumn , Issue , 2012, Pages

  Dash, Dinesh ^a   Bishnu, Arijit ^b   Gupta, Arobinda ^a   Nandy, Subhas C ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

^b INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT FACTORS; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; COVERAGE PROBLEM; LINE SEGMENT; NP-HARD; POLYNOMIAL TIME APPROXIMATION SCHEMES; RECTANGULAR REGIONS; SENSING RADIUS; SENSING REGION; SET OF LINES;

APPROXIMATION ALGORITHMS; COMMUNICATION SYSTEMS; POLYNOMIAL APPROXIMATION; WIRELESS SENSOR NETWORKS;

SENSORS;

EID: 84863421452     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/COMSNETS.2012.6151346     Document Type: Conference Paper

References (31)

1. Optimizing placement of beacons and data loggers in a sensor network - a case study. In Wireless Communications and Networking Conference, pages 2486-2491, March 2004.
2. A. Agnetis, E. Grande, P. B. Mirchandani, and A. Pacifici. Covering a line segment with variable radius discs. ACM Computers & Operations Research, 36(5):1423-1436, 2009.
3. X. Bai, S. Kumar, D. Xuan, Z. Yun, and T. H. Lai. Deploying wireless sensors to achieve both coverage and connectivity. In ACM Inter. Symposium on Mobile Ad Hoc Networking & Computing, pages 131- 142. Florence, Italy, 2006. (Pubitemid 44300714)
4. P. Balister, Z. Zheng, S. Kumar, and P. Sinha. Trap coverage: Allowing coverage holes of bounded dimeter in wireless sensor network. In IEEE INFOCOM, 2009.
5. K. Baumgartner and S. Ferrari. A geometric transversal approach to analyzing track coverage in sensor networks. IEEE Trans. Computers, 57(8):1113-1128, 2008.
6. P. Carmi, M. Katz, and N. Lev-Tov. Covering points by unit disks of fixed location. In Intl. Symp. on Alg. and Comp., pages 644-655, 2007.
7. P. Carmi, M. J. Katz, and N. Lev-Tov. Polynomial time approximation schemes for piercing and covering with applications in wireless networks. Computational Geometry: Theory and Applications, 39(3):209-218, 2008. (Pubitemid 350267399)
8. K. Chakrabarty, S. S. Iyengar, H. Qi, and E. Cho. Grid coverage for surveillance and target location in distributed sensor networks. IEEE Trans. on Computers, 51(12):1448-1453, 2002.
9. T. M. Chan. Polynomial-time approximation schemes for packing and piercing fat objects. Journal of Algorithms, 46(2):178-189, 2003.
10. T. M. Chan and A.-A. Mahmood. Approximating the piercing number for unit-height rectangles. In CCCG, pages 15-18. Windsor, Ontario, 2005.
11. F. Claude, G. K. Das, R. Dorrigiv, S. Durocher, R. Fraser, A. Lopez-Ortiz, B. G. Nickerson, and A. Salinger. An improved line-separable algorithm for discrete unit disk cover. Discrete Mathematics, Algorithms, and Applications, 2(1):1-11, 2010.
12. T. Clouqueur, V. Phipatanasuphorn, P. R., and K. K. Saluja. Sensor deployment strategy for target detection. In WSNA, pages 42-48. Atlanta, Georgia, USA, 2002.
13. D. Dash, A. Bishnu, A. Gupta, and S. C. Nandy. Approximation algorithm for line segment coverage for wireless sensor network. CoRR, abs/1006.2955, 2010.
14. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, second edition, 2000.
15. A. DuttaGupta, A. Bishnu, and I. Sengupta. Maximal breach in wireless sensor networks: Geometric characterization and algorithms. In ALGOSENSORS, pages 126-137, 2007.
16. R. J. Fowler, M. S. Paterson, and S. L. Tanimoto. Optimal packing and covering in the plane are np-complete. Information Processing Letters, 12(3):133-137, 1981.
17. R. S. V. H. Galota M, Glaber C. A polynomial-time approximation scheme for base station positioning in umts networks. In International workshop on discrete algorithms and methods for mobile computing and communications, pages 52-60, 2001.
18. T. F. Gonzalez. Covering a set of points in multidimensional space. Information Processing Letters, 40:181-188, 1991.
19. P. W. X. J. Hai Liu. Maximal lifetime scheduling for k to 1 sensor-target surveillance networks. Computer Networks, 50(15):2839-2854, 2006.
20. J. Harada, S. Shioda, and H. Saito. Path coverage properties of randomly deployed sensors with finite data-transmission ranges. Computer Networks, 53(7):1014-1026, 2009.
21. D. Hochbaum and W. Maass. Approximation schemes for covering and packing problems in image processing and vlsi. Journal ACM, 32(1):130-136, 1985. (Pubitemid 15599048)
22. C. Huang and Y. Tseng. The coverage problem in wireless sensor network. Mobile Network and Applications, 10(4):519-528, 2005. (Pubitemid 40859663)
23. J.-E. Kim, M.-K. Yoon, J. Han, and C.-G. Lee. Sensor placement for 3-coverage with minimum separation requirements. In Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems, DCOSS '08, pages 266-281, Berlin, Heidelberg, 2008. Springer-Verlag.
24. S. Kumar, T. H. Lai, and A. Arora. Barrier coverage with wireless sensors. In ACM MOBICOM, pages 284-298. Cologne, Germany, 2005. (Pubitemid 43206611)
25. S. Megerian, F. Koushanfar, M. Potkonjak, and M. B. Srivastava. Worst and best-case coverage in sensor networks. IEEE Trans. on Mobile Computing, 4(1):753-763, 2005.
26. S. S. Ram, D. Manjunath, S. K. Iyer, and D. Yogeshwaran. On the path coverage properties of random sensor networks. IEEE Trans. on Mobile Computing, 6(5):446-458, 2007. (Pubitemid 46495728)
27. M. T. Thai, F. Wang, and D. Du. Coverage problems in wireless sensor networks: Designs and analysis. ACM Journal of Sensor Network, 3(3):191-200, 2008.
28. C. Wu, K.C.Lee, and Y. Chung. A delaunay triangulation based method for wireless sensor network deployment. ACM Computer Communications, 30(14-15):2744-2752, 2007. (Pubitemid 47445724)
29. G. Xing, X. Wang, Y. Zhang, C. Lu, R. Pless, and C. Gill. Integrated coverage and connectivity configuration for energy conservation in sensor networks. ACM Trans. on Sensor Networks, 1(1):36-72, 2005.
30. X. Xu and S. Sahni. Approximation algorithms for sensor deployment. IEEE TRANSACTIONS ON COMPUTERS, 56(12), December 2007.
31. Z. Zhang and D.-Z. Du. Radar placement along banks of river. Journal of Global Optimization, pages 1-13. 10.1007/s10898-011-9704-3.