In wireless sensor networks, two approaches of tree and mesh routing are introduced to determine the path of packets during the transition process. Tree routing is a simple routing protocol with low overhead that in this protocol father-child bonds for packet transmission from the source to the destination is used. The biggest problem of routing is the increase of the number of mutations in comparison with other routing protocols. In order to improve this problem, protocols have been introduced in recent years to determine a shortcut path on the basis of the tree routing. This study is an attempt to analyse and evaluate the existing routing algorithms, identify and overcome their disadvantages, also in some other protocols, only reducing the number of mutations has been discussed. However, to achieve this goal leads to increased energy consumption and thus reducing the lifetime of the network; reducing the number of mutations is an important parameter and can reduce delays in the network, however, it should be noted the energy consumption in ZigBee networks is a very important debate. Besides that, this study will try—in addition to reducing the average number of mutations—to reduce the traffic load near the root node in the proposed algorithms. As a result, on the one hand, the application of this algorithm in ZigBee networks reduces delays and on the other hand, will also lead to balancing of load and energy in the network. Using this algorithm, the scope and lifetime of the proposed protocol-based networks can be increased.