Study Of Tree Routing Algorithm Based On The Neighbor Table In ZigBee Networks

ZigBee is a new short distance wireless communication technology which has low-cost,low complexity and low-power consumption,and the technology is widely used in the application fields of industrial control,household,wireless communication and so on.ZigBee modules usually use battery for power.Computing power and bandwidth of nodes are very limited in ZigBee networks,so it is essential for the effective use of ZigBee node energy.Currently the energy-saving technology of the ZigBee networks routing has become an important topic for the ZigBee networks research,but the existing ZigBee networks routing algorithms are lack of attention on the use of node energy,many ZigBee networks routing algorithms only focus on efficiency and ignore ZigBee node energy,these factors lead to the result that a ZigBee network can not be efficiently run for a long time.Researching a highly efficient,energy-saving ZigBee networks routing algorithm is crucial.The purpose of this study is to design efficient,energy-saving ZigBee networks tree routing algorithms by using 1-hop neighbor table,a tree routing algorithm based on the neighbor table and LQI in ZigBee networks and a tree routing algorithm of energy balance based on the neighbor table in ZigBee networks are proposed.In the tree routing algorithm based on the neighbor table and LQI in ZigBee networks,in order to alleviate the problem that the existing ZigBee tree routing algorithm has many hop counts,long delay of data transmission and so on,the algorithm establishs the strategy of neighbor nodes selection with the aid of 1-hop neighbor nodes address information,and selects the neighbor node which has the minimum tree hop counts as the next hop forwarding node in 1-hop neighbor nodes.When hop counts are the same,the node of high LQI value is selected as the next hop forwarding node.Theoretic analysis proves that routing path of the algorithm is superior to the routing paths of the tree routing algorithm and ITRA algorithm.The paper uses Matlab to simulate the tree routing algorithm based on the neighbor table and LQI in ZigBee networks.The simulation results show that the algorithm can reduce the number of forwarding nodes efficiently,improve the reliability of the network data transmission and achieve the purpose of improving the network performance.In the tree routing algorithm of energy balance based on the neighbor table in ZigBee networks,in order to improve the overall performance of ZigBee networks and service life,the algorithm is on the basis of the existing ZigBee tree routing algorithm,uses 1-hop neighbor table,considers the node residual energy and routing cost,and selects the neighbor node which has abundant energy and minimum tree hop counts as the next forwarding node.Theoretical analysis shows that the algorithm has low time complexity and could find a primary pathway.The paper uses Matlab to simulate the tree routing algorithm of energy balance based on the neighbor table in ZigBee networks.The simulation results show that the algorithm can effectively reduce the overall the network energy consumption,void using the node of low residual energy as the forwarding node,postpone the appear of nodes death time,reduce effectively the number of death node,and extend the service life of the ZigBee networks.