Research On Energy Efficient Clustering Routing Algorithm Of Wireless Sensor Networks

As the main data source of Internet of things and big data,Wireless Sensor Networks(WSN)has been widely used in various fields such as environmental monitoring and intelligent transportation.However,the energy of sensor nodes is limited,and most of the energy is mainly used for inter-node communication.Therefore,whether the routing algorithm is efficient determines whether the sensor network is stable,and designing efficient routing algorithm to improve the life of the network is the key research direction of WSN at present.Fuzzy Logic(FL)algorithm and Particle Swarm Optimization(PSO)algorithm are two efficient hierarchical routing algorithms,but they still have many shortcomings.In order to overcome the drawback that FL-based routing algorithm cannot ensure the accuracy of fuzzy rules,and the drawbacks that PSO-based routing algorithm has large search space and uneven distribution of cluster heads,this thesis proposes two improved schemes.The main work of this article is as follows:(1)Clustering Routing algorithm based on PSO-optimized FL(CRPSOFL)is proposed.In order to solve the problem that the utilization rate of cluster head is low caused by the proximity of some cluster head nodes,the cluster-head campaign mechanism is formed based on the FL algorithm within the same cluster-radius to ensure that there is only one cluster head node in the cluster radius.And aiming at overcoming the problem that fuzzy rules determined by human experience are not necessarily accurate,the fuzzy rules are optimized by the PSO algorithm to extend the network life.And in the view of the problem of energy waste caused by nodes closer to the base station sending data through the farther cluster head,the clusterselection mechanism is designed.Nodes closer to the base station do not join any cluster,and send data directly to the base station.The experimental results show that when the node energy is 0.5 J in the area of 100 m * 100 m,compared with Low Energy Adaptive Clustering Hierarchy(LEACH),Gupta,Cluster Head Election mechanism using Fuzzy logic(CHEF),the CRPSOFL algorithm can prolong the network life by approximately 58%,28.7%,and 17.8%.(2)In order to solve the problems of large search space and uneven distribution of cluster heads caused by the search of cluster head combinations in the entire node area in PSO-based routing algorithm,EM-PSO routing algorithm is proposed.First,the EM algorithm is used to cluster the nodes in the region into the optimal clusters.Then,the optimal cluster head search is performed in parallel in each cluster based on the PSO algorithm.Therefore,the cluster head search space is reduced and the cluster head nodes are evenly distributed in the whole region.At the same time,the nodes in the region search the cluster-head nodes by themselves,which saves the communication energy consumption of sending residual energy and other information to the base station in each round.The experimental results show that in the area of 100 m * 100 m with a node energy of 0.5 J,compared with LEACH,EM,and PSO algorithms,the EM-PSO algorithm can prolong the network life by approximately 27.1%,24%,and 7%.