An Improved Uneven Clustering Routing Algorithm for Sensor Networks
An Improved Uneven Clustering Routing Algorithm for Sensor Networks
复制标题
DOI：
10.1109/cnmt.2009.5374819
复制
发表时间：
2009-12
期刊：
影响因子：
--
通讯作者：
Yonggang He;Tingrong Xu
中科院分区：
文献类型：
--
作者：
Yonggang He;Tingrong Xu
在大规模部署的无线传感器网络中，基于分簇的路由算法中的簇头节点通过多顶通信将数据传输到汇点时，离汇点较近的簇头节点承受着繁重的中继流量，容易过早死亡，造成能量空洞，影响网络的正常运行。它缩短了网络的使用寿命。为了解决能量空洞问题，提出了一种基于非均匀分簇的改进路由算法(RAUC)。根据邻居节点的平均剩余能量与自身剩余能量之比、簇内通信开销来选举簇头，形成不同大小的簇。簇间路由基于节点的转发能力。仿真结果表明，与LEACH和EEUC相比，该算法具有更好的负载均衡性能，降低了节点的能量消耗，有效地提高了网络的生存时间。
In the large-scale deployment of wireless sensor networks, when cluster-heads of the routing algorithm based on clustering transmit their data to sink via multi-top communication, the cluster-heads closer to sink are burdened with heavy relay traffic and tend to die early, causing energy holes that affect the normal operation of the network. It shortens the lifetime of network. To solve the problem of energy holes, an improved routing algorithm based on uneven clustering (RAUC) is proposed. Cluster-heads are elected based on the ratio between the average residual energy of neighbor nodes and itself residual energy, the intra-cluster communication cost, forming clusters of different sizes. The inter-cluster routing is based on the forwarding capacity of nodes. The simulation shows that, compared with LEACH and EEUC, the routing algorithm performs better at load balancing, reduces the energy consumption of nodes, effectively improves the lifetime of the network.