Approximations for minimum connected sensor cover

Proceedings - IEEE INFOCOM

Volumn , Issue , 2013, Pages 1187-1194

  Wu, Lidong ^a   Du, Hongwei ^b,c   Wu, Weili ^a   Li, Deying ^d   Lv, Jing ^b   Lee, Wonjun ^e  

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

^b HARBIN INSTITUTE OF TECHNOLOGY   (China)

^c Shenzhen Key Laboratory of Internet Information Collaboration   (China)

^d RENMIN UNIVERSITY OF CHINA   (China)

^e Korea University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION SOLUTION; COMMUNICATION RANGE; CONNECTED GRAPH; DETERMINISTIC APPROXIMATION; PERFORMANCE RATIO; POLYNOMIAL-TIME APPROXIMATION ALGORITHMS; RANDOM ALGORITHMS; SENSING RANGES;

SENSOR NETWORKS;

APPROXIMATION ALGORITHMS;

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

References (31)

1. S.M.N. Alam and Z.J. Haas, Coverage and connectivity in threedimensional networks, MobiCom06, 2006.
2. C. Ambuhl, T. Erlebach, M. Mihalak and M. Nunkesser, Constantapproximation for minimum-weight (connected) dominating sets in unit disk graphs, Proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2006), LNCS 4110, Springer, 2006, pp. 3-14.
3. X. Bai, S. Kumar, D. Xuan, Z. Yun, and T.H. Lai, DEploying wireless sensors to achieve both coverage and connectivity, MobiHoc06, 2006, pp.131-142.
4. Y. Bartal, Probability approximation of metric spaces and its algorithmic applications, Proc of 37th FOCS, 1996, pp. 184-193.
5. Y. Bartal, On approximating arbitrary metrics by tree metrics, Proc of 30th STOC, 1998, pp. 161-168.
6. Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss and Laura Sanita, An improved LP-based approximation for Steiner tree, STOC10, June 5-8, 2010, pp. 583-592.
7. M. Cardei and D.-Z. Du, Improving wireless sensor network lifetime through power aware organization, ACM Wireless Networks, Vol. 11, No. 3, pp. 333-340, May 2005.
8. Mihaela Cardei, My Thai, Yingshu Li, and Weili Wu, Energy-efficient target coverage in wireless sensor networks, IEEE INFOCOM (2005).
9. Mihaela Cardei, Dave MacCallum, Xiuzhen Cheng, Manki Min, Xiaohua Jia, Deying Li and Ding-Zhu Du, Wireless sensor networks with energy efficient organization, Journal of Interconnection Networks vol 3 no 3-4 (2002) 213-229.
10. M. Cardei and J. Wu, Coverage in wireless sensor networks, in Handbook of Sensor Networks, M.Ilyas and I. Mahgoub (eds.), CRC Press, 2004.
11. M. Cardei, Coverage problems in sensor networks, Handbook of Combinatorial Optimization (2nd Edition), P. M. Pardalos, D. Z. Du, and R. Graham (eds.), Springer, to appear.
12. Maggie X. Cheng, Lu Ruan and Weili Wu, Achieving minimum coverage breach under bandwidth constraints in wireless sensor networks, INFOCOM 2005, pp. 2638-2645.
13. C. Chekuri, G. Even and G. Kortsarz, A greedy approximation algorithm for the group Steiner problem, Discrete Applied Mathematics, 154 (2006) 15-34.
14. Ling Ding, Weili Wu, James K. Willson, Lidong Wu, Zaixin Lu and Wonjun Lee, Constant-approximation for target coverage problem in wireless sensor networks, Proc. of The 31st Annual Joint Conf. of IEEE Communication and Computer Society (INFOCOM), 2012.
15. D.-Z. Du, Ker-I Ko, and X. Hu, Design and Analysis of Approximation Algorithms, Springer, 2012, pp. 142-157.
16. T. Erlebach and M. Mihalk, A (4+)-approximation for the minimumweight dominating set problem in unit disk graphs, WAOA 2009, pp. 135-146.
17. G. Even, G. Kortsarz, An approximation algorithm for the group Steiner problem, Proceedings of SODA, 2002, pp. 49-58.
18. S. Funke, A. Kesselman, F. Kuhn, Z. Lotker, and M. Segal, Improved approximation algorithms for connected sensor cover, Wireless Networks 13 (2007) 153-164.
19. N. Garg, G. Konjevod and R. Ravi, A polylogarithmic approximation algorithm for the group Steiner tree problem, SODA, 2000.
20. N. Garg and J. Konemann, Faster and simpler algorithms for multicommodity flows and other fractional packing problems, Proc. 39th Annual Symposium on the Foundations of Computer Science, 1998, pp 300-309.
21. A. Ghosh and S.K. Das, Coverage and connectivity issues in wireless sensor networks, in Movile, Wireless, and Sensor Networks: Technology, Applications, and Future Directions, by R. Shorey, A.L. Ananda, M.C. Chan, and W.T. Ooi (eds.), John Wiley & Sons, Inc., 2006, pp. 221-256.
22. A. Ghosh and S.K. Das, A distributed greedy algorithm for connected sensor cover in dense sensor networks, LNCS 3560 (2005) 340-353.
23. H. Gupta, S.R. Das and Q. Gu, Connected sensor cover: self-organization of sensor networks for efficient query execution, MobiHoc03, 2003, pp. 189-200.
24. 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 (2009) 174-194.
25. G. Xing, X. Wang, Y. Zhang, C. Liu, R. Pless, and C. Gill, Integrated coverage and connectivity configuration for energy conservation in sensor networks, ACM Transactions on Sensor Networks, vol. 1 no. 1 (2005) 36-72.
26. S. Yang, F. Dai, M. Cardei, J. Wu and F. Patterson, On connected multiple point coverage in wireless sensor networks, Journal of Wireless Information Networks 13 (2006), pp. 289-301
27. Z. Zhou, S. Das, H. Gupta, Connected k-coverage problem in sensor networks, Proceedings of the 13th International Conference on Computer Communications and Networks, 2004, pp. 373-378.
28. H. Zhang and J. C. Hou, Maintaining sensing coverage and connectivity in large sensor networks, Ad Hoc & Sensor Wireless Networks 1 (2005) 89-124.
29. Z. Zhou, S.R. Das, H. Gupta, Variable radii connected sensor cover in sensor networks, ACM Transactions on Sensor Networks, vol. 5 no. 1 (2009).
30. Feng Zou, Yuexuan Wang, Xiaohua Xu, Hongwei Du, Xianyue Li, Pengjun Wan and Weili Wu, New approximations for weighted dominating sets and connected dominating sets in unit disk graphs, Theoretical Computer Science vol 412 no 3 (2011) 198-208.
31. F. Zou, X. Li, S. Gao, and W. Wu, Node-weighted Steiner tree approximation in unit disk graphs, J. Comb. Optim. 18 (2009) 342-349.