一种改进的ZigBee网络能量均衡簇树路由算法  

An Improved Energy Balanced Cluster-tree Routing Algorithm for ZigBee Network

作　　者：李岩[1] 袁安娜[1] 柳培新[1] 郑洁琼[1] 刘精松[1] 

机构地区：[1]哈尔滨理工大学计算机科学与技术学院,黑龙江哈尔滨150080

出　　处：《哈尔滨理工大学学报》2013年第5期56-60,共5页Journal of Harbin University of Science and Technology

基　　金：国家自然科学基金(61103149);黑龙江省教育厅科学技术研究项目(12521100)

摘　　要：针对ZigBee网络中的簇树路由算法存在网络节点能量消耗不均衡造成网络过早瘫痪的问题,提出一种改进的能量均衡簇树路由算法.该算法综合考虑单个节点生存周期和整个网络能量消耗,定义了节点能量水平以及节点权值,根据节点父子关系和权值建立了一种分簇机制,避免单个节点的不必要能量消耗和死亡,并优化AODVjr算法缩短路由距离,降低簇间通信延迟和路由开销.仿真结果表明,该算法相较于簇树路由算法减小了3.6%的网络整体能量消耗,延长了约15%的网络生命周期.Aiming at the premature paralysis of network problem of Cluster-Tree algorithm which is caused by energy consumption imbalance of node in ZigBee, an inproved energy balanced Cluster-Tree routing algorithm is proposed. This algorithm considers the single node＇ s survival cycle and the energy consumption of the whole net- work, and it defines the energy level and weight of node, according to the relationship of father-son and weight of node to establish an clustering mechanism in order to avoid unnecessary energy consumption and death of a single Cluster-Tree algorithm, the improved routing algorithm has a 3.6% decrease in the energy consumption of the whole network and prolongs the network＇ s lifetime for about15%.

关 键 词：ZIGBEE网络 簇树算法 AODVjr算法 分簇 能量均衡 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]