一种基于邻居表的ZigBee树路由综合加权改进算法  

An Improved Comprehensive Weighted Routing Algorithm Based on Neighbor Tree Routing of ZigBee

作　　者：常赟杰 张位勇 李桂香 CHANG Yunjie;ZHANG Weiyong;LI Guixiang(Department of Computer and Information Science,Hunan Institute of Technology,Hengyang 421002)

机构地区：[1]湖南工学院计算机与信息科学学院,衡阳421002

出　　处：《计算机与数字工程》2018年第3期528-532,共5页Computer & Digital Engineering

基　　金：湖南省教育厅科学研究项目(编号:13C207);湖南工学院科学研究项目(编号:HY13004)资助

摘　　要：针对ZigBee树路由协议的数据包转发线路不是最优的特点,提出了一种综合加权改进算法。算法从最短跳数、剩余能量和链路质量三个方面综合考虑,在邻居表中选取最优的节点进行数据包转发。实验结果表明,算法优于ZigBee树路由协议,均衡了网络中节点的能量,提高了网络生存周期。算法采用树索引TI来计算源节点到目的节点的跳数,减少了数据包转发过程中的计算开销。算法在于大规模、存储能力有限、低功耗的ZigBee网络具有广泛的应用前景。This paper presents a new improved comprehensive weighted routing algorithm for the data package forwarding of the ZigBee tree routing protocol is not the optimal routing.The protocol choose the optimal node from neighbor table taking into consideration of the shortest hop,the remain energy and the link quality.Results shows that the protocol is superior to the short tree protocol for balancing the node??s energy and it prolongs the lifetime of the ZigBee network.Besides,it uses the tree index to reduce the complexity of routing cost calculation.The protocol is used in numerous applications requiring small memory capacity and low energy consumption.

关 键 词：ZIGBEE网络 树路由协议 能量均衡 邻居表 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]