基于邻居表的ZigBee网络树路由改进算法

摘要

Aiming at the problems of ZigBee tree routing algorithm that the algorithm has many hop counts and so on,a tree rou-ting improvement algorithm based on the neighbor table in ZigBee networks was proposed.With the aid of 1-hop neighbor nodes address information,the strategy of neighbor nodes selection was established in the proposed algorithm,the neighbor node which has the minimum tree hop counts was selected as the next hop forwarding node.When hop counts were the same,the node with high LQI value was selected as the next hop forwarding node in this algorithm.Theoretic analysis proves that routing path of this algorithm is superior to that of the tree routing algorithm and ITRA algorithm.The simulation results show that the improved algorithm can reduce the number of forwarding nodes efficiently,improve the reliability of the network data transmission and achieve the purpose of improving the network performance.%针对ZigBee网络树路由算法路由跳数多、数据传输延时长等问题，提出一种基于邻居表的ZigBee网络树路由改进算法。借助一跳邻居节点地址信息，建立邻居节点选择策略，在节点的一跳邻居节点中，选择到达目的节点树路由跳数最少的邻居节点作为下一跳转发节点。在树路由跳数相同时，选取LQI值大的节点为下一跳转发节点。理论分析结果表明，该算法路由路径优于树路由算法和ITRA算法路由路径；实验结果表明，该算法能很好地减少转发节点个数，提高了网络数据传输的可靠性，达到网络性能提高的目的。