Algorithm for minimal connected cover set problem in wireless sensor networks

Ruan Jian Xue Bao/Journal of Software

Volumn 17, Issue 2, 2006, Pages 175-184

  Jiang, Jie ^a   Fang, Li ^a   Zhang, He Ying ^a   Dou, Wen Hua ^a  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

Author keywords

MCCS (minimal connected cover set); MIS (maximal independent set); MST (minimum spanning tree); Network lifetime; Voronoi tessellation; WSN (wireless sensor network)

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMMUNICATION; COMPUTATIONAL COMPLEXITY; NUMERICAL METHODS; PERFORMANCE;

CENTRALIZED VORONOI TESSELLATION (CVT); COMMUNICATION CONNECTIVITY; GREEDY ALGORITHM; MAXIMAL INDEPENDENT SET (MIS); MINIMAL CONNECTED COVER SET (MCCS); MINIMUM SPANNING TREE (MST); NETWORK LIFETIME; VORONOI TESSELLATION; WIRELESS SENSOR NETWORK (WSN);

SENSORS;

EID: 33744762528     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: 10.1360/jos170175     Document Type: Article

References (18)

1. Akyildiz IF, Su W, Sankarasubramaniam Y, Cayirci E. Wireless sensor networks: A survey. Computer Networks, 2002, 38(4): 393-422.
2. Elson J, Estrin D. Sensor Networks: A Bridge to the Physical World. Norwell: Kluwer Academic Publishers, 2004. 3-20.
3. Ren FY, Huang HN, Lin C. Wireless sensor networks. Journal of Software, 2003, 14(7): 1282-1291 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/14/1282.htm
4. Cui L, Ju HL, Miao Y, Li TP, Liu W, Zhao Z. Overview of wireless sensor networks. Journal of Computer Research and Development, 2005, 42(1): 163-174 (in Chinese with English abstract).
5. Slijepcevic S, Potkonjak M. Power efficient organization of wireless sensor networks. In: Proc. of the Int'l Conf. on Communications. Helsinki: IEEE Communication Society, 2001. 472-476.
6. Abrams Z, Goel A, Plotkin S. Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In: Ramchandran K, Sztipanovits J, eds. Proc. of the 3rd Int'l Conf. on Information Processing in Sensor Networks. Berkeley: ACM Press, 2004. 424-432.
7. Ye F, Zhong G, Lu S, Zhang L. Peas: A robust energy conserving protocol for long-lived sensor networks. In: McKinley PK, Shatz S, eds. Proc. of the 23rd Int'l Conf. on Distributed Computing Systems. Providence: IEEE Press, 2003. 28-37.
8. Tian D, Georganas N. A coverage-preserving node scheduling scheme for large wireless sensor networks. In: Raghavendra CS, Sivalingam KM, eds. Proc. of the 1st ACM Int'l Workshop on Wireless Sensor Networks and Applications. Atlanta: ACM Press, 2002. 32-41.
9. Chen H, Wu H, Tzeng N. Grid-Based approach for working node selection in wireless sensor networks. In: Viginier P, ed. Proc. of the Int'l Conf. on Communications. Paris: IEEE Press, 2004. 3673-3678.
10. Carbunar B, Grama A, Vitek J, Carbunar O. Coverage preserving redundancy elimination in sensor networks. In: Znati T, Raghavendra CS, eds. Proc. of the 1st IEEE Conf. on Sensor and Ad Hoc Communications and Networks. Santa Clara: IEEE Press, 2004. 377-386.
11. Yan T, He T, Stankovic J. Differentiated surveillance service for sensor networks. In: Akyildiz IF, Estion D, eds. Proc. of the 1st Int'l Conf. on Embedded Networked Sensor Systems. Los Angels: ACM Press, 2003. 51-63.
12. Gupta H, Das SR, GU Q. Connected sensor cover: Self-Organization of sensor networks for efficient query execution. In: Gerla M, ed. Proc. of the ACM MobiHoc 2003. Annapolis: ACM Press, 2003. 189-200.
13. Bulusu N, Heidemann J, Estrin D. GPS-Less low cost outdoor localization for very small devices. IEEE Personal Communications Magazine, 2000, 7(5): 28-34.
14. He H, Huang C, Blum BM, Stankovic JA, Abdelzaher TF. Range-Free localization schemes in large scale sensor networks. In: Johnson DB, ed. Proc. of the ACM MobiCom 2003. San Diego: ACM Press, 2003. 81-95.
15. Romer K, Zurich E. The lighthouse location system for smart dust. In: Siewiorek D, ed. Proc. of the 1st Int'l Conf. on Mobile Systems, Applications, and Services. San Francisco: ACM Press, 2004. 15-30.
16. Okabe A, Boots B, Sugihara K, Chiu S. Spatial Tessellations: Concepts and Applications of Voronoi Diagram. 2nd ed., New York: John Wiley and Sons, 1999.
17. Hochbaum DS. Approximation Algorithms for NP-Hard Problems. Cambridge: PWS Publishing Company, 1995.
18. Cormen TH, Leiserson CE, Rivest RL, Stein C. Introduction to Algorithms. 2nd ed., Cambridge: MIT Press, 2001.