The shortest path algorithm in Zigbee wireless embedded network

When selecting a shortest path in Zigbee wireless embedded network, there are several issues such time-consuming, high system cost and complexity both in network working time and high variety. This paper proposes a new algorithm to get rid of these issues. First, network tree model is proposed according to the Zigbee network nodes. Then, the subtree network nodes are established based on the self-defined function and rules, including the sub-tree node and arc. Finally, the solution on the algorithm is illustrated compared with traditional shortest path.