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

Wireless Networks

Volumn 19, Issue 5, 2013, Pages 857-870

  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

Approximation algorithm; Coverage; Sensor

Indexed keywords

CONSTANT FACTORS; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; COVERAGE; COVERAGE PROBLEM; POLYNOMIAL TIME APPROXIMATION SCHEMES; RECTANGULAR REGIONS; SENSING RADIUS; SENSING REGION;

POLYNOMIAL APPROXIMATION; SENSORS; WIRELESS SENSOR NETWORKS;

APPROXIMATION ALGORITHMS;

EID: 84879799225     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11276-012-0506-4     Document Type: Article

References (30)

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