Research On Energy Utility Routing Algorithms In Wireless Sensor Networks

Wireless sensor network technology is currently one of the most influential technologies and has been widely used in military,medical and environmental monitoring fields.Wireless sensor networks are composed of many tiny sensor nodes.These nodes are arbitrarily distributed in a certain area for data collection.They have certain energy,storage capabilities,communication capabilities,and computing capabilities,but resources are limited.Traditional network protocols are not It cannot be directly applied to wireless sensor networks,so researching energy-efficient and efficient wireless sensor network routing protocols is very meaningful and valuable,and it is also one of the current research hotspots.This paper mainly studies the routing protocol of wireless sensor networks from the perspective of energy saving.Firstly,an OPFH routing protocol based on OPTICS clustering algorithm is proposed for the poor convergence of HEED routing protocol and unequal energy consumption.The algorithm first uses the OPTICS clustering algorithm to divide the network into multiple first-level clusters,and then performs cluster-head election in each first-level cluster;In the process of candidate cluster head competition to generate the final cluster head,use the current energy of the cluster head and its distance from the base station,get the optimal cluster radius by fuzzy logic control.The optimal cluster radius competition produces the final cluster head.A multi-hop routing mechanism is established between the cluster head nodes to send data to the base station.Simulation experiments show that the energy consumption between and within the clusters is more balanced,effectively extending the network survival time.This paper also proposes a non-uniform clustering routing protocol based on simulated annealing algorithm,which effectively alleviates the "hot-spot" problem in some multi-hop clustering routing protocols.The algorithm first establishes a cost function based on the current energy of the non-cluster head,the current energy of the cluster head,the distance between the non-cluster head and the cluster head,and the distance between the cluster head and the base station.Non-cluster head choose cluster heads with high energy and close to themselves and the base station to join.In order to select the cluster head,established the cost function according to the current energy among the cluster heads.Establish cost function based on the distance between the cluster head and the base station make the sum of the distance between the cluster head and the base station small.Then,minimize the sum of cost functions by simulated annealing algorithm.Experiments show that the algorithm effectively achieves load balancing across the entire network and achieves the purpose of extending the life of wireless sensor networks.