一种簇半径可变的无线传感器网络分簇算法

Novel clustering algorithm for wireless sensor networks with variable cluster radius

分簇可以延长无线传感器网络的生存周期。LEACH等分簇算法在簇头数量、簇头分布等方面存在较大的随机性,限制了网络能耗的降低。提出了一种簇半径可变的无线传感器网络分簇算法：CAVCR。该算法优先在剩余能量较大的节点中选择簇头,并限制簇头之间的最小距离。在分簇时,簇头根据相邻节点的数量和距离计算簇内通信代价,以此调整自己的簇半径。CAVCR算法稳定了簇头数量,在一定程度上实现了簇头的均匀分布和簇头能耗的均匀。通过仿真和数据分析,证明该算法能提高网络的生存周期。

Clustering Algorithm can prolong the lifetime of wireless sensor networks（ WSN）. Clustering algorithms,such as LEACH,have great randomness in the number of cluster heads（ CHs）,CHs distribution and so on. This randomness is not conducive to the reduction of network energy consumption. Propose a clustering algorithm for WSNs with variable cluster radius（ CAVCR）. The algorithm chooses the CHs among the nodes with high residual energy,and limits the minimum distance between CHs. When clustering,a CH adjusts its cluster radius according to the cluster communication cost that is calculated by the number of neighbor nodes and the distances to the neighbor nodes. CAVCR stabilizes the number of CHs and achieves the uniform distribution and energy consumption of CHs to a certain extent. Simulation experiments were made to compare CAVCR with three related algorithms. The experimental results show that CAVCR can prolong the lifetime of WSN.