Research On Adaptive Clustering Routing Algorithm For WSN Energy Optimization

Wireless sensor network(Wireless Sensor Network,WSN)is a network formed by many low-power sensor nodes carrying limited energy through self-organization.It realizes the automation and intelligence of the information collection system through sensor nodes to perceive,process and transmit information to the monitored objects.At present,it is widely used in various fields,promoting the development of social production and improving people's lives.Due to the small size of sensor nodes and limited memory and energy resources,the development of wireless sensor networks is severely restricted.Therefore,how to reduce network energy consumption and extend the network life cycle has become the focus of wireless sensor network research.In this paper,clustering routing is selected as the research object,and two different clustering routing algorithms,"improved clustering routing algorithm based on LEACH" and "optimization algorithm for adaptive harmony search clustering routing based on circular candidate domains",are designed for WSN.For energy optimization,this paper separately improves the topology structure during clustering and the path optimization during data transmission to achieve the purpose of reducing network energy consumption,balancing load,and extending network life cycle.Its main contents include:(1)In a large-scale wireless sensor network with multi-hop transmission,because the randomness of the LEACH protocol to elect the cluster head is too high,the LEACH protocol has the disadvantages of unreasonable cluster head position and unbalanced network energy consumption.This paper proposes an improved non-uniform clustering routing algorithm based on the LEACH protocol.The improved algorithm is clustered in rounds,and the cluster head election process is implemented in two steps: First,the cluster head energy factor,cluster head distance factor,cluster radius factor,cluster density factor,etc.,which are associated with the current operating state of the network,are introduced into LEACH In the threshold of the protocol,and use the improved threshold to select the candidate cluster head;then draw on the idea of uniform clustering,and use the competition radius to select the real cluster head from the candidate cluster heads.Finally,after clustering is completed,in order to reduce the energy consumption of the cluster head and find the optimal path for data forwarding,the algorithm introduces influencing factors such as the remaining energy of the cluster head,the distance between the cluster head and the base station,and the transmission direction angle.Simulation experiment results show that the improved algorithm has a life cycle extended by 196 rounds compared with the original algorithm,and the distribution of dead nodes is also more uniform,indicating that the improved algorithm can effectively extend the network life cycle and balance network energy consumption.(2)The harmony search algorithm(HSA)is applied to cluster head election and routing,and a harmony search clustering routing algorithm based on circular candidate domain is proposed.First,in the cluster head election stage,a new fitness function is proposed by introducing factors such as cluster head residual energy factor,intra-cluster distance deviation,and inter-cluster minimum distance deviation.Then,the state of the algorithm is predicted by the change of the fitness value in the period.According to the result of the prediction,the state of the algorithm is divided into three states: stagnation,dormancy,and update.In the creative process,a fine tuning method based on circular candidate domains,a random fine tuning method based on extreme deviations,and a new harmony generation method based on reverse learning and random mutation operators are designed.In the data transmission stage,it combines the remaining energy of the cluster head,the distance between clusters,the distance between the cluster head and the base station to balance the problem of uneven energy consumption caused by intra-cluster and inter-cluster routing.Finally,the proposed algorithm is compared with clustering algorithms such as LEACH,PSO-C,CRHS,and the simulation results show that the improved algorithm can effectively extend the network life cycle and reduce network energy consumption.