Two-hop neighbor table tree routing algorithm for ZigBee networks

摘要

For the problems that the tree routing algorithm and the existing routing algorithm based on the neighbor table have unbalanced traffic load and a long data transmission path, the two-hop neighbor table tree routing algorithm for ZigBee networks is proposed. The algorithm uses the two-hop neighbor table, selects the two-hop neighbor node as the target node which has the smallest tree routing hops to the destination node, and selects the one-hop neighbor node as the next forwarding node which can reach the target node and has the smallest tree routing hops to the destination node. Theoretical analysis and simulation results show that the algorithm can reduce the routing hops, end-to-end delay effectively, compared with the tree routing algorithm, the ImpTR algorithm and the STR algorithm.