Evidence-Efficient Multihop Clustering Routing Scheme for Large-Scale Wireless Sensor Networks

被引:5
作者
Li, Zhihua [1 ]
Xin, Ping [1 ]
机构
[1] Jiangnan Univ, Sch Internet Things Engn, Dept Comp Sci & Technol, Wuxi 214122, Jiangsu, Peoples R China
关键词
ALGORITHM; TREE; COLLECTION; PROTOCOL;
D O I
10.1155/2017/1914956
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Energy consumption and transmission reliability are the most common issues in wireless sensor networks (WSNs). By studying the broadcast nature of data transmission in WSNs, the mechanism of guaranteeing reliable transmission is abstracted as propagation of responsibility and availability. The responsibility and availability represent the accumulated evidence of nodes to support reliable transmission. Based on the developed mechanism, an evidence-efficient cluster head rotation strategy and algorithm are presented. Furthermore, backbone construction algorithm is studied to generate the minimum aggregation tree inside the candidate cluster heads. A minimum aggregation tree-based multihop routing scheme is also investigated, which allows the elected cluster heads to choose the optimally main path to forward data locally and dynamically. As a hybridization of the above, an evidence-efficient multihop clustering routing (EEMCR) method is proposed. The EEMCR method is simulated, validated, and compared with some previous algorithms. The experimental results show that EEMCR outperforms them in terms of prolonging network lifetime, improving transmission reliability, postponing emergence of death nodes, enhancing coverage preservation, and degrading energy consumption.
引用
收藏
页数:14
相关论文
共 33 条
[1]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[2]  
[Anonymous], 2000, P 33 ANN HAW INT C S
[3]  
ARBOLEDA L., 2006, Proc. Canadian Conference on Electrical and Computer Engineering (CCECE), P1787
[4]  
Bang Wang, 2010, Proceedings of the 2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks (MSN 2010), P85, DOI 10.1109/MSN.2010.19
[5]   A distributed energy-efficient clustering protocol for wireless sensor networks [J].
Chamam, Ali ;
Pierre, Samuel .
COMPUTERS & ELECTRICAL ENGINEERING, 2010, 36 (02) :303-312
[6]   Topology evolution of wireless sensor networks among cluster heads by random walkers [J].
State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210093, China ;
不详 ;
不详 .
Jisuanji Xuebao, 2009, 1 (69-76) :69-76
[7]  
Chengfa Li, 2005, 2005 IEEE International Conference on Mobile Adhoc and Sensor Systems
[8]  
Cobos M., 2017, WIRELESS COMMUNICATI, V2017, P1
[9]  
Cui Ke-xiang, 2012, Computer Engineering, V38, P104, DOI 10.3969/j.issn.1000-3428.2012.23.025
[10]   Clustering by passing messages between data points [J].
Frey, Brendan J. ;
Dueck, Delbert .
SCIENCE, 2007, 315 (5814) :972-976