Research On WSNs Clustering Routing Algorithm Based On Energy Balance

Wireless sensor networks(WSNs),as the cutting-edge technology in the 21st century,has greatly extended human perception and has been widely used in various fields of social development.Because the charging technology of sensor node is not mature,it can not supplement the energy of the node in time.Therefore,designing an effective clustering routing algorithm to reduce and balance the overall energy consumption of WSNs has become a hot research topic.In this dissertation,energy consumption balance is taken as the research breakthrough point,combined with intelligent algorithm with strong autonomy and high search accuracy and virtual partition according to network energy consumption hot spots.Aiming at the problems of unbalanced energy consumption of nodes and high energy consumption of routing path in WSNs,the following specific work is carried out(1)An improved ant lion clustering routing algorithm(ialocra)based on energy balance is proposed.The algorithm considers the residual energy of nodes and the overall transmission distance to screen the candidate nodes of the cluster head;balances the attraction of the elite ant lion to the ants,so that the ants have higher ergodicity;update the ant search boundary formula to enhance the convergence of the algorithm;balance the global and local solution ability of the algorithm in different iteration periods to obtain the better cluster head node;when transmitting information,sink node takes itself as the The root node outward topology,combined with the next hop distance,the remaining energy and the number of sub nodes,constructs the minimum spanning tree transmission path,reduces and balances the network energy consumption and prolongs the network lifetime.In order to verify the effectiveness of the routing algorithm,the ialocra algorithm is compared with leach and other similar algorithms in the same WSNs network model.Experimental results show that compared with other algorithms,the network lifetime of ialocra is prolonged by 523 rounds and 392 rounds respectively.(2)A non uniform partitions multi hop clustering algorithm(npmca)is proposed.Firstly,the algorithm uses concentric equal ring spacing network model,and obtains the optimal ring spacing through experimental verification,so as to balance the energy consumption of each ring;through the formula of cluster head,it obtains the number of cluster heads when each ring meets the full coverage,and selects high-quality cluster head nodes from three aspects of node energy,intra cluster energy consumption variance and intra cluster energy consumption;the inter cluster transmission measures the energy of next hop node,communication distance and jump The three factors of included angle make the cluster head node choose the appropriate inter cluster transmission path.In order to solve the problems of unreasonable election and distribution of cluster head nodes and unequal network energy consumption,the purpose of balancing,reducing node energy consumption and extending network lifetime is achieved.Simulation results show that npmca can effectively extend the network lifetime of 206 rounds and 129 rounds respectively compared with leach and other similar algorithms in the circular WSNs area.The simulation results show that in the small WSNs environment,the above two routing algorithms can effectively screen cluster head nodes,control path length and node energy consumption,and have certain optimization effect on extending the network life cycle.FIG.[19]Table[6]Reference[71]...