The study of ZigBee network routing algorithm based on adjacent relation

摘要

Cluster-Tree routing algorithm of ZigBee network is considered as a parent-child relationship to route. For the networks which have large depth, the forward of data packet makes the energy loss of parent node increase sharply, that will take great risks and low the routing efficiency. To solve these problems, this paper proposes an improved Cluster-Tree routing algorithm. On the basis of analyze Cluster-Tree routing algorithm, we bring limited adjacency relation node into the new algorithm. The main idea of the new algorithm is to judge whether the destination address is the adjacent nodes' address of the current node or children nodes' address of the adjacent node, and complete the routing choice in routing process. Statistical simulation results show that the improved routing algorithm not only improves routing efficiency, but also greatly reduces network risk due to forwarding packets.