K-CHRA: A Clustering Hierarchical Routing Algorithm for Wireless Rechargeable Sensor Networks

作     者：Wei, Zhenchun Liu, Fei Ding, Xu Feng, Lin Lyu, Zengwei Shi, Lei Ji, Jianjun 

作者机构：Hefei Univ Technol Sch Comp Sci & Informat Engn Hefei 230009 Anhui Peoples R China Hefei Univ Technol Engn Res Ctr Safety Crit Ind Measurement & Contro Minist Educ Hefei 230009 Anhui Peoples R China Anhui Prov Key Lab Ind Safety & Emergency Technol Hefei 230009 Anhui Peoples R China 

出 版 物：《IEEE ACCESS》 (IEEE Access)

年 卷 期：2019年第7卷

页      面：81859-81874页

核心收录：

基　　金：National Natural Science Foundation of China [61701162, 61502142] National Key Research and Development Program of China [2016YFC0801804, 2016YFC0801405] 

主　　题：Wireless rechargeable sensor networks hierarchical routing algorithm clustering 

摘      要：Routing technology is an indispensable part of wireless sensor networks (WSNs) in contemporary studies. Considerable attention is being given to the energy problem and the delay of data transmission. However, a few studies have explored routing algorithms in wireless rechargeable sensor networks (WRSNs) using mobile charging equipment. In this paper, we propose a clustering hierarchical routing algorithm for WRSNs based on K-means method (K-CHRA), which takes the energy distribution and data transmission into consideration under the influence of mobile equipment (ME) while combining mobile sink and mobile charger in WRSNs. The mobile sink is responsible for data collection and mobile charger replenishes energy for sensor nodes. The simulations demonstrate that K-CHRA can reduce energy consumption and the data transmission delay. Thus, K-CHRA has excellent equilibrium characteristics with balanced energy dissipation throughout all sensor nodes in the networks. Finally, a large number of experiments demonstrate that our proposed algorithm K-CHRA suits for many kinds of scenarios of networks.