Research Of Clustering Routing Algorithm In Wireless Sensor Networks Based On Energy Optimization

Energy constraint is one of the most important application challenges in wireless sensor networks(Wireless Sensor Networks,WSNs).Therefore,compared to traditional networks,WSNs must pay more attention to energy utilization and extend network life.The clustering routing algorithm is considered to be among the effective ways to collect and transmit data in WSNs,but there are several challenges at this stage: First,the energy consumption challenge of the cluster head.The cluster head is mainly responsible for data aggregation and data transmission tasks,and plays a vital role in the cluster.Compared with non-cluster head nodes,its energy consumption is faster.Second,the clustering challenge.Traditional clustering algorithms tend to have the same size in each cluster.However,due to the randomness of the node distribution,the equal clustering mechanism is obviously not applicable.Third,the intercluster routing challenge.The traditional inter-cluster routing algorithm considers the index to be relatively single,and is easy to fall into a local optimal solution.In view of the above situation,this paper studies the unequal clustering routing algorithm in WSNs based on energy optimization.The specific work and research results are as follows:1.The research background and status of routing protocols in WSNs are described,and the current routing protocols in WSNs are classified and summarized.In view of the shortcomings in the existing research results,this paper proposes the clustering algorithm(AKDEC)based on adaptive kernel density estimation to optimize the cluster head selection and cluster establishment mechanism.AKDEC utilizes fuzzy logic system to solve the uncertainty of cluster head selection.On this basis,the kernel density estimation algorithm was adopted to calculate the adaptive cluster radius to balance the energy consumption.The results of simulation experiments prove the advantages and effectiveness of AKDEC in the cluster initial establishment stage.2.In order to save the transmission cost of inter-cluster,this paper designs an inter-cluster routing algorithm(CACOR)based on chaotic ant colony optimization.CACOR introduces logistic chaotic map to perturb the pheromone update,to avoid the algorithm falling into a suboptimal solution;CACOR improves the transition probability formula to select the best next hop node,and releases the forward ants to update the local pheromone;From the perspective of energy dispersion coefficients and distance coefficients,CACOR designs the optimal path and updates the global pheromone through backward ants.The results of simulation experiments prove the advantages and effectiveness of CACOR in the cluster stable transmission stage.3.In order to solve the energy constraint of WSNs,this paper proposes an energyoptimized clustering routing algorithm(EOCRA)in WSNs.The algorithm is divided into two stages: the cluster initial establishment stage and the cluster stable transmission stage.In the cluster initial establishment stage,based on AKDEC idea,an adaptive kernel density estimation algorithm is used to fit the cluster radius to achieve unequal clustering.Based on the establishment of clusters,the best inter-cluster transmission path is found based on CACOR idea,and a global routing backbone network is established.The results of simulation experiments prove that EOCRA has obvious advantages in network life,energy efficiency and energy balance.