ZigBee路由协议算法的研究

通过对ZigBee中的Cluster-Tree算法以及对AODVjr中的路由发现进行研究,在Cluster-Tree邻居表的基础上提出捷径路由,从该节点周围的邻居节点中找出可以用少量跳数即可到达目的节点。此后通过路由代价函数,计算通过Cluster-Tree改进算法中找到节点路径的能量使用代价,选择可靠性较高的路径,从而可以延长网络生存周期和降低能耗。最后通过实例,验证了算法改进的可行性。

Research on Zigbee Routing Protocol Algorithm

This paper puts forward the short-cut route base on the Cluster-Tree neighbour table by studying of the Cluster-Tree and AODVjr routing algorithm in the Zigllee , and finds a node which can reach the destination node by using a few route hop from the node. The node which can be found by the improved Cluster-Tree algorithm can prolongate the network life cycle and reduce the energy consumption using the routing cost function. Experiments prove the feasibility of the idea.