基于最小生成树的非均匀分簇路由算法

摘要

The existing uneven clustering routing algorithms do not consider the optimal path selection between cluster heads and base station, which leads to unbalanced energy consumption. In order to balance energy consumption of transmission paths, this paper proposed an uneven clustering routing algorithm based on minimum spanning tree. The algorithm utilized residual energy of nodes and the distance between nodes and base station to select cluster heads, and then generated minimum spanning tree to search the optimal transmission paths, which reduced energy consumption on the transmission paths and effectively solved unbalanced energy consumption. The theoretical analysis and experimental results show that the algorithm is better than the existing Energy Efficient Uneven Clustering ( EEUC) and Energy Balancing Clustering Algorithm ( EBCA) in terms of the number of live nodes and energy consumption.%发现现有的针对非均匀分簇路由算法没有充分考虑簇首与基站之间最优路径选择,而导致传输路径上的能量消耗不均衡的问题.为了更好地均衡传输路径上节点能量的消耗,提出了基于最小生成树的非均匀分簇的路算法.该算法利用节点剩余能量和节点到基站的距离选举簇首,然后通过建立最小生成树搜寻最优传输路径,这样可以减少传输路径上的能量消耗,有效地解决能耗不均衡问题.理论分析和实验结果均表明,该算法无论在存活节点个数还是在能量消耗上都明显优于EEUC算法和EBCA.