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

基于最小生成树非均匀分簇路由算法 　　摘 要:发现现有的针对非均匀分簇路由算法没有充分考虑簇首与基站之间最优路径选择,而导致传输路径上的能量消耗不均衡的问题。为了更好地均衡传输路径上节点能量的消耗,提出了基于最小生成树的非均匀分簇的路由算法。该算法利用节点剩余能量和节点到基站的距离选举簇首,然后通过建立最小生成树搜寻最优传输路径,这样可以减少传输路径上的能量消耗,有效地解决能耗不均衡问题。理论分析和实验结果均表明,该算法无论在存活节点个数还是在能量消耗上都明显优于EEUC算法和EBCA。 　　关键词: 　　簇首;非均匀分簇;不均衡;剩余能量;最小生成树 　　中图分类号: TP393 文献标志码:A 　　? 　　Uneven clustering routing algorithm based on minimum spanning tree 　　? 　　ZHANG Ming?cai???*?, XUE An?rong, WANG Wei 　　?( 　　School of Computer Science and Telecommunication Engineering, Jiangsu University, Zhenjiang Jiangsu 212013, China 　　)? 　　Abstract: 　　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. 　　?Key words: 　　cluster head; uneven clustering; unbalanced; residual energy; minimum spanning tree 　　? 　　 　　0 引言? 　　无线传感器网络(Wireless Sensor Network, WSN)作为新兴的网络测控技术,能够自主进行数据采集、融合和传输。由于节点与基站的距离较远,节点之间一般都采用多跳的形式进行数据传输。在这种“多对一”的数据传输模式中,导致靠近基站的节点会因转发过多的??量而死亡,出现能量消耗不均衡现象。因此,如何均衡各个节点之间能量消耗是WSN研究的热点。? 　　为了减少冗余数据开销,Heinzelman等??[1]?提出了自适应的分簇路由算法,方便了节点管理和控制信道的接入,减少开销,提高资源的利用效率,有效地降低节点能量消耗,延长网络的生命周期,但在分簇传感器网络中,由于簇首到基站的距离比较远,簇首与基站之间需要通过多跳路由的方式进行传输和转发数据,这样进行数据传输时,将会造成离基站近的簇首因过多地转发数据而消耗大量的能量,导致能量消耗的不均衡问题；文献[2]提出了一种能量