A Two-stage Clustering Sleep Scheduling Algorithm with Particle Swarm Optimization in Wireless Sensor Networks

被引:0
作者
Guo, Wenzhong [1 ]
Chen, Guolong [2 ]
Yu, Chaolong [2 ]
Su, Jinshu [1 ]
Liu, Zhanghui [2 ]
机构
[1] Natl Univ Def & Technol, Sch Comp Sci, Changsha 410073, Hunan, Peoples R China
[2] Fuzhou Univ, Coll Math & Comp Sci, Fuzhou 350108, Peoples R China
基金
中国国家自然科学基金;
关键词
Wireless sensor networks; energy management; clustering; sleep scheduling; particle swarm optimization; SCHEME; PROTOCOL; COVERAGE; HYBRID; NODES;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The energy of sensor nodes in wireless sensor networks (WSNs) is limited and difficult to be replenished, therefore energy conservation and energy management play a very important role in prolonging network lifetime. To improve energy efficiency, a two-stage clustering sleep scheduling algorithm with particle swarm optimization (TCSS-PSO), combining clustering algorithm and sleep scheduling algorithm, is proposed in this paper. Different sleep scheduling mechanisms are adopted in two stages: a centralized sleep scheduling mechanism and a distributed sleep scheduling mechanism. In the centralized sleep scheduling mechanism, particle swarm optimization (PSO) is used to balance network coverage and energy consumption. Distributed sleep scheduling mechanism schedules the nodes according to their neighbors' information and their remaining energy, while it provides an automatic wake-up mechanism to ensure network coverage and effectively respond to changes in the network. Analysis and simulation results show that our algorithm can make a good balance between the improvement of network energy consumption effectiveness and the maintenance of network coverage, effectively prolonging the network's lifetime in some extent.
引用
收藏
页码:27 / 49
页数:23
相关论文
共 26 条
[1]   A survey on sensor networks [J].
Akyildiz, IF ;
Su, WL ;
Sankarasubramaniam, Y ;
Cayirci, E .
IEEE COMMUNICATIONS MAGAZINE, 2002, 40 (08) :102-114
[2]   A distributed node scheduling protocol considering sensing coverage in wireless sensor networks [J].
Cho, Jaekyu ;
Kim, Gilsoo ;
Kwon, Taekyoung ;
Choi, Yanghee .
2007 IEEE 66TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-5, 2007, :352-356
[3]   Scheduling sleeping nodes in high density cluster-based sensor networks [J].
Deng, J ;
Han, YS ;
Heinzelman, W ;
Varshney, P .
MOBILE NETWORKS & APPLICATIONS, 2005, 10 (06) :825-835
[4]   Balanced-energy sleep scheduling scheme for high-density cluster-based sensor networks [J].
Deng, J ;
Han, YSS ;
Heinzelman, WB ;
Varshney, PK .
COMPUTER COMMUNICATIONS, 2005, 28 (14) :1631-1642
[5]  
Dou JF, 2010, AD HOC SENS WIREL NE, V10, P89
[6]  
Dousse O., 2004, P 5 ACM INT S MOBILE, P109, DOI DOI 10.1145/989459.989474
[7]  
Duarte-Melo EJ, 2002, GLOB TELECOMM CONF, P21
[8]   Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach [J].
Gong, Yue-Jiao ;
Zhang, Jun ;
Liu, Ou ;
Huang, Rui-Zhang ;
Chung, Henry Shu-Hung ;
Shi, Yu-Hui .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 2012, 42 (02) :254-267
[9]   Approximation algorithms for connected dominating sets [J].
Guha, S ;
Khuller, S .
ALGORITHMICA, 1998, 20 (04) :374-387
[10]   An application-specific protocol architecture for wireless microsensor networks [J].
Heinzelman, WB ;
Chandrakasan, AP ;
Balakrishnan, H .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2002, 1 (04) :660-670