基于动态簇半径的非均匀分簇算法

Uneven Clustering Algorithm Based on Dynamic Cluster Radius

在无线传感器网络分簇路由算法中,针对节点能耗不均衡所引发的"热区"问题,提出了基于动态簇半径的非均匀分簇算法(UCDCR)。该算法在簇组建阶段,对网络进行区域划分,不同区域的候选簇首通过簇竞争半径来构建大小不同的簇,使簇首随网络的运行动态的改变簇竞争半径,为数据转发预留更多能量。仿真结果表明:与EEUC算法和CUCRA算法相比,UCDCR算法更加有效地均衡了节点能耗,延长了网络生命的周期。

In wireless sensor network clustering routing algorithm, an uneven clustering algorithm based on dynamic cluster radius （UCDCR） is put forward in view of ＂hot spot＂ caused by unbalanced node energy consumption.In clustering stage, the network is divided into different areas,and the condldate cluster head uses the competition radius of cluster to build clusters with different size.So the cluster head can dynamicallychange competition radius of cluster to reserve more energy for data forwarding. The simulation experiments show that the UCDCR algorithm can effectively balance the energy consumption of nodes and prolong the network life cycle compared with EEUC algorithm and CUCRA algorithm.