关键词: 自适应分簇, 等级, 无线传感器网络, 能量异构, 移动性

Abstract: To solve the short life time and low network thuoughput problems caused by the heterogeneity and mobility of Wireless Sensor Networks (WSNs), an adaptive clustering algorithm based on grades(ACA_G) was proposed. The algorithm runs on rounds, which is composed of three stages: the adaptive clustering stage, the cluster construction stage, the data transmission stage. In the adaptive clustering stage, every partition may be subdivided or united to keep an appropriate number of nodes in it, according to the change of the number of nodes in each partition. The adaptive clustering measure could be able to solve the irreasonability of the number of cluster-heads and the scale of clusters caused by the mobility in WSNS. In order to deal with the phenomenons caused by the heterogeneity in WSNS, select the node with the highest grade as the cluster-head in the cluster construction stage. The grade of each node is calculated according to the surplus energy, the speed of energy consumption, the distance between the node and the base station, the accumulate distance between other nodes in the same cluster. All measures in the cluster construction stage can alleviate the influence caused by that some nodes dead too fast and the life time of WSNS is shortened. In the experiment circumstance in Matlab of the Internet of Things with the energy heterogeneity, and in which nodes mobile at the speed of 0-0.6m/s romdonly, experiment results demonstrate that:compared with LEACH-Mobile algorithm and DEEC algorithm, the life time of WSNS clustered by the proposed algorithm is longer 30.9% than the other two algorithms, the network thoughout is 1.15 times at least as many as the other two algorithms.

Key words: adaptive clustering, grade , Wireless Sensor Networks (WSNs), energy heterogeneity, mobility