Affiliations: [a] College of Computer Science and Engineering, Northwest Normal University, Lanzhou, Gansu, China | [b] Future Television Limited, Tianjin, China
Correspondence:
[*]
Corresponding author: Fengzhen Li, College of Computer Science and Engineering, Northwest Normal University, Lanzhou, Gansu, China. E-mail: lifengzhen2018@163.com.
Abstract: To optimize energy consumption in wireless sensor networks (WSNs) and prolong life cycle of networks, aiming at the problems in LEACH algorithm, such as random selection of cluster-heads, indeterminate cluster-heads number, accelerated death of cluster-head nodes and so on, an efficient clustering routing algorithm for WSNs (EECR) was proposed. This algorithm is based on LEACH algorithm. In the cluster building stage, four sub-thresholds were designed, i.e. residual energy of node, based on base-station distance, number of cluster-head in networks and round number that nodes are selected as cluster-heads. In stable data transmission stage, the effective path of node was utilized and free spatial model and multi-path attenuation model were integrated to realize effective data transmission. In simulation experiment, the network life, residual energy and information amount received by base station were compared. The results indicate that, compared to LEACH, LEACH-C, HEED and EEUC, the EECR algorithm can effectively reduce energy consumption and prolong network lifetime, and its overall performance is superior to LEACH, LEACH-C, HEED and EEUC algorithms.
Keywords: WSNs, clustering, energy-efficient routing, sub threshold, data transmission effectively
