基于目标簇树的Zigbee路由算法研究

针对Cluster‐T ree路由算法效率低下以及AODVjr路由算法控制开销过高的问题，在邻居表的基础上，结合AODVjr的路由发现机制，本文提出一种基于目标簇树的路由算法，该算法将目的节点邻近的祖先节点和后裔节点视为源节点搜寻与目的节点间路由路径的重点搜索对象，其核心点在于判断下一跳，在路由寻找过程中存在两种情形，其一是在邻近节点中发现属于目标簇树的节点，其二是借助于改进型AODVjr算法进行判断选择。最终NS2仿真结果表明本文提出的路由算法相对于Cluster‐T ree路由算法减少了路由跳数，在控制开销上相比于 AODVjr路由算法则大大降低，该算法在这两个参数之间达到一种平衡。

Research of Zigbee routing algorithm based on target Cluster Tree

To resolve the problem of low efficiency of Cluster‐Tree routing algorithm and high control overhead of AODVjr .Routing algorithm ,a new routing algorithm based on Target Cluster Tree is given on the basis of neighbor table and routing discovery mechanism of AODVjr .In this algorithm the ancestor nodes and descendant nodes are regarded as key search objects of the routing path between the source node and destination node ,and its key point is to determine the next hop .There are two kinds of situation in the process of routing ,one is that the nodes of target cluster tree are found in the adjacent nodes ,and the other is that the next hop is choosed based on the improved AODVjr algorithm .The NS2 simulation results show that the routing algorithm in this paper has fewer routing hops than Cluster‐Tree routing algorithm and less control overhead than AODVjr routing algorithm ,it avoids going to extremes between these two parameters .