基于非均匀分簇和最小能耗的无线传感网络路由算法

The Routing Algorithm for WSNs Based on Unequal Clustering and Minimum Energy Consumption

簇头以多跳方式传输数据到网关时,靠近网关的簇头由于负担较多的转发任务而过早死亡,从而造成了"能量空洞"现象.文中提出了一种基于非均匀分簇的能量有效的无线传感网络路由算法(UCRA).它包括非均匀分簇算法和最小能耗路由算法2部分.首先提出一种加权的非均匀分簇算法(WUCA),在分簇时考虑了节点的选票和传输距离.在簇间通信时提出了最小能耗多跳路由算法.它利用位置信息计算最优转发簇头位置,从而指导下一跳簇头的选择.仿真结果表明,UCRA算法能很好地平衡网络能耗,延长网络生命周期.

Clustering and multi-hop routing can improve the energy efficiency of wireless sensor networks （WSNs）. However, when cluster heads transmit their data to a sink via multi-hop communication, nodes around the sink are burdened with heavy relay traffic and tend to die early, which results in the energy hole and network partition problems. This paper proposed an energy efficient unequal-clustering routing algo rithm （UCRA） for WSNs, which consists of a weighted unequal-clustering algorithm （WUCA） and a multi-hop routing algorithm. WUCA takes into consideration the vote and transmission power of a sensor node when grouping the sensor nodes into unequal clusters. This paper designed the minimum energy con- sumption （MEC） multi-hop routing algorithm for inter-cluster communication. It exploits sensor nodes＇ location information to determine an MEC routing path. The simulation results show that UCRA balances the energy consumption among sensor nodes and achieves a substantial improvement on the network life time.