Research And Improvement Of ZigBee Routing Algorithm

ZigBee technology is a short distance and reliable transmission wireless communication technology.Because it has the advantages of low power consumption,low cost and self organizing network,it has been widely applied to military,environmental monitoring,industrial medical and other fields.At present,with the rapid promotion and development of the Internet of things and intelligent cities,the research on ZigBee technology is also deepening.However,due to the complexity of the hardware system,many researchers have focused on the routing technology as the core of the network layer.The improvement of routing algorithm has become a hot topic in recent years.Based on the IEEE802.15.4 standard,this paper contrasts the differences and relations between the various layers of the ZigBee network.This paper introduces the technical features of ZigBee network,and studies the three routing protocols commonly used in cluster tree topology,Cluster-Tree,AODVjr and ZBR.After that,the characteristics of NS2 simulation platform are described,and the performance metrics of commonly used routing protocols are introduced,which lays a theoretical foundation for optimization and improvement.Then it introduces the concept,characteristics and advantages of ant algorithm,as well as traditional application scenarios of traditional ant colony algorithm.The source nodes and destination nodes in the AODVjr network are respectively abstracted into ants to explore "ants" and "food sources" in the food process,and the data transmission in the network is abstracted into the foraging process of ants.The traditional ant colony algorithm is optimized by improving the pheromone volatilization mechanism,i.e.the global modification of pheromone intensity of ant colony.Aiming at the shortcomings of traditional AODVjr,an improved ant colony algorithm routing protocol is designed.Secondly,considering the lifetime of single node and the energy consumption of the whole network,a ZigBee Energy Balanced Routing Algorithm Based on weight clustering is proposed.By defining the energy level of nodes and the weight of nodes,a clustering mechanism based on weight isestablished.In terms of data transmission mechanism,in order to avoid generating a large number of redundant RREQ packets,it is required that only cluster heads can broadcast RREQ packets,and avoid redundant RREQ packets generation by limiting RREQ flooding direction.In the first round of cluster transformation,we introduce the concept of node similarity.Cluster heads choose the neighbor nodes that are very similar to themselves in the cluster to act as the replacement cluster heads,so as to minimize the change of network topology and avoid the extra energy consumption caused by reclustering.In the process of routing repair,different routing repair strategies are selected according to the node relationship at the end of the failure link.In the end of each algorithm chapter,the improved algorithm is designed and realized based on NS2 network simulation platform.And from routing overhead,the average end-to-end delay,the delivery rate and residual energy node survival rate and network dimension compared with algorithm based on the improved before,to verify the superiority of the optimization algorithm.