The Resrarch And Optimization Of Routing Protocol Based On ZigBee Wireless Network

In recent years,the Internet of Things technology has developed rapidly,and some related technologies such as FRID,wireless sensor networks and embedded technology has also developed correspondingly.At the same time,a variety of short-range wireless sensor network protocol standards are also diverse and yield unusually brilliant results.Among them,ZigBee technology are currently widely used in wireless sensor networks because of its low cost,low power consumption,low complexity,high reliability and other features.At present,with the wider application of ZigBee technology,the research on ZigBee network is also constantly advancing.The ZigBee network routing protocol is of great significance to the performance of the whole ZigBee network,hence how to an efficient energy and low transmission delay becomes the research focus of network routing algorithm.The existing Cluster-Tree routing algorithm is improved for cluster-Tree routing algorithm and existing tree-based routing algorithm based on neighbor table,such as hops too large,node traffic load imbalance and node energy imbalance.The algorithm selects the node with the optimal number of hops in the local range as the next hop node by introducing the neighbor table maintained between the nodes.Secondly,by introducing the energy classification mechanism,the algorithm uses the neighbor table to select the hop number.The results show that the improved algorithm can find a shorter transmission path than the original Cluster-Tree routing algorithm,and protect the nodes with lower depth to a certain extent.The simulation data show that the improved algorithm can effectively reduce the end-to-end average delay,reduce the network energy consumption and reduce the network packet loss rate.AODVjr routing algorithm routing will bring a lot of invalid routing control overhead during the process of routing discovery and routing maintenance,which will not only cause network congestion,but also increase the entire network energy consumption and transmission delay and other issues.To solve this problem,the original AODVjr routing algorithm should be improved from two stages,i.e.route maintenance and route repair.Firstly,the broadcast scope and direction of the RREQ request frame are set adaptively according to the parent-child relationship established when the node was added to the network.Secondly,for the local routing maintenance broadcasting a large number of routing control packets,the routing table entries is improved to maintain the local routes within the minimum range.Theoretical analysis shows that the improved algorithm effectively limits the number of routing control packets in the network.The simulation data show that the improved algorithm can reduce the number of routing control packets in the network,reduce the average delay of the end-to-end nodes,and reduce the energy consumption of the nodes.