Constant-approximation for target coverage problem in wireless sensor networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2012, Pages 1584-1592

  Ding, Ling ^a   Wu, Weili ^a   Willson, James ^a   Wu, Lidong ^a   Lu, Zaixin ^a   Lee, Wonjun ^b  

^a The University of Texas at Dallas   (United States)

^b Korea University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

COVERAGE PROBLEM; MINIMUM TOTAL WEIGHTS; MINIMUM WEIGHT; PERFORMANCE RATIO; POLYNOMIAL-TIME; TARGET COVERAGE;

APPROXIMATION ALGORITHMS; SENSORS;

POLYNOMIAL APPROXIMATION;

EID: 84861618557     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2012.6195527     Document Type: Conference Paper

References (24)

1. P. Berman, G. Calinescu, C. Shah, and A. Zelikovsky. Efficient energy management in sensor networks. In Ad Hoc and Sensor Networks, Wireless Networks and Mobile Computing, 2005.
2. S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. Srivastava. Coverage problems in wireless ad-hoc sensor networks. In Proc. of IEEE INFOCOM, 2001.
3. M. T. Thai, F. Wang, D. H. Du, and X. Jia. Coverage problems in wireless sensor networks: designs and analysis. International Journal of Sensor Networks, special issue on Coverage Problems in Sensor Networks, 3:191-200, 2008.
4. V. Raghunathan, C. Schurgers, S. Park, M. Srivastava, and B. Shaw. Energy-aware wireless microsensor networks. In IEEE Signal Processing Magazine, pages 40-50, 2002.
5. M. Cardei, M. T. Thai, Y. Li, and W. Wu. Energy-efficient target coverage in wireless sensor networks. In Proc. of IEEE INFOCOM, 2005.
6. G. Xing, R. Tan, B. Liu, J. Wang, X. Jia, and C.-W. Yi. Data fusion improves the coverage of wireless sensor networks. In Proc. of ACM MobiCom, 2009.
7. W. Wang, V. Srinivasan, K.-C. Chua, and B. Wang. Energy-efficient coverage for target detection in wireless sensor networks. In Proc. of ACM IPSN, 2007.
8. F. Zou, Y. Wang, X.-H. Xu, X. Li, H. Du, P.-J. Wan, and W. Wu. New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs. Theoretical Computer Science, 412.
9. Y. Huang, X. Gao, Z. Zhang, and W. Wu. A better constant-factor approximation for weighted dominating set in unit disk graph. Journal of Combinatorial Optimization, 18(2):179-194, 2009.
10. F. Ye, G. Zhong, S. Lu, and L. Zhang. Energy efficient robust sensing coverage in large sensor networks. In Proc. of IEEE ICDCS, 2002.
11. N. Garg and J. Koenemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proc. of IEEE FOCS, 1998.
12. K. Kar and S. Banerjee. Node placement for connected coverage in sensor networks. In Proc. of IEEE WiOpt, 2003.
13. K. Dasgupta, M. Kukreja, and K. Kalpakis. Topology-aware placement and role assignment for energy-efficient information gathering in sensor networks. In Proc. of IEEE ISCC, 2003.
14. D. Tian and N. D. Georganas. A coverage-preserving node scheduling scheme for large wireless sensor networks. In Proc. of ACM WSNA, 2002.
15. P. Berman, G. Calinescu, C. Shah, and A. Zelikovsky. Power efficient monitoring management in sensor networks. In Proc. of IEEE WCNC, 2004.
16. M. Cardei and D.-Z. Du. Improving wireless sensor network lifetime through power aware organization. Wireless Network, 11:333-340, 2005. (Pubitemid 41217860)
17. M. Lu, J. Wu, M. Cardei, and M. Li. Energy-efficient connected coverage of discrete targets in wireless sensor networks. In Proc. of ICCNMC, 2005.
18. Y. Li, C. Vu, C. Ai, G. Chen, and Y. Zhao. Transforming complete coverage algorithms to partial coverage algorithms for wireless sensor networks. To appear in IEEE Transactions on Parallel and Distributed Systems, 2010.
19. H. Zhang and J. C. Hou. Maintaining sensing coverage and connectivity in large sensor networks. Ad Hoc & Sensor Wireless Networks, 1, 2005.
20. X.-Y. Li, P.-J. Wan, and O. Frieder. Coverage in wireless ad hoc sensor networks. IEEE Transaction on Computers, 52(6):753-763, 2003.
21. S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. B. Srivastava. Coverage problems in wireless ad-hoc sensor networks. In Proc. of IEEE INFOCOM, 2001.
22. W.-C. Ke, B.-H. Liu, and M.-J. Tsai. Constructing a wireless sensor network to fully cover critical grids by deploying minimum sensors on grid points is np-complete. IEEE Transactions on Computers, 56:710-715, 2007. (Pubitemid 46563351)
23. Y. Wang and G. Cao. On full-view coverage in camera sensor networks. In Proc. of IEEE INFOCOM, 2011.
24. Y. Li and S. Gao. Designing k-coverage schedules in wireless sensor networks. Journal of Combinatorial Optimization, 15:127-146, 2008.