基于能量均衡的ZigBee网络树路由算法  

ZigBee tree routing algorithm based on energy balance

作　　者：班艳丽[1] 柴乔林[1] 王琛[1] 

机构地区：[1]山东大学计算机科学与技术学院,济南250101

出　　处：《计算机应用》2008年第11期2791-2794,共4页journal of Computer Applications

摘　　要：针对ZigBee网络树路由算法中的路由非最优以及某些节点可能会因为业务量过大而过早耗尽电池能量的问题,提出一种改进的基于能量均衡的ZigBee树路由算法。改进算法中通过引入邻居表,考虑路由跳数使路由局部最优,同时改进算法中也考虑了节点的剩余能量,路由选择的时候尽量避开剩余能量较低的节点。仿真结果表明,改进算法能有效地节省网络的总体能量消耗,实现网络负载均衡,最大化网络的生存时间。Aiming at the problems of ZigBee tree routing algorithm that the routing may not be optimal and some nodes may use up all the energy, because of heavy transmissions, an improved ZigBee tree routing algorithm based on energy balance was proposed. The neighbor table was introduced to make sure that the routing was locally optimal by considering the routing hops. At the same time, the residual energy of nodes was also considered to avoid selecting some nodes with low residual energy in routing selection. The simulation results show that the energy consumption was reduced efficiently, the problem of unbalanced load was resolved and the lifetime of the whole network was maximized in this improved algorithm.

关 键 词：ZIGBEE网络 树路由 邻居表 剩余能量 OMNET++仿真 

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