关键词: 网络热区, 分簇路由算法, 簇首确定, 动态簇半径, 剩余能量

Abstract: In view of the defects of the current clustering routing algorithm in wireless sensor network, such as the unaverage energy consumption and the premature death of nodes, we proposed an improved low energy adaptive clustering hierarchy (LEACH) routing algorithm for wireless sensor networks. Firstly, aiming at problem of the premature death of wireless sensor nodes, the dynamic determination of cluster radius was introduced, and the whole wireless sensor network was divided into multiple inhomogeneous clusters. Secondly, we considered the problem of fast energy consumption of cluster heads, and selected the cluster heads in each round according to the location of the cluster heads and the residual energy of the nodes. Finally, the data transmission mechanism was improved to ensure the balance of the energy consumption of nodes, and the performance of clustering routing algorithm in wireless sensor networks was tested on the MATLAB 2014 platform. The test results show that the improved LEACH algorithm solves the problem of premature death of nodes, prolongs the lifetime of the wireless sensor network and balances the energy consumption of each node. The performance of the whole wireless sensor network is significantly better than that of other comparison algorithms.

Key words: network hot area, clustering routing algorithm, cluster head determination, dynamic cluster radius, residual energy