关键词: Cluster tree, 捷径路由, 路由代价函数

Abstract:

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 ZigBee,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.

Key words: Cluster tree;short cut route;routing cost function