Research On Clustering Routing Algorithm In Wireless Sensor Networks

As the basis of the "Internet of Everything",wireless sensor networks collect and transmit data through nodes in the network.Due to the limited energy of the node itself,the running time of the network is very limited,which is also the main factor restricting the development of wireless sensor networks.Designing a routing algorithm that can efficiently use limited energy to balance network energy consumption and extend network operation time has always been one of the hotspots of wireless sensor networks research.On the basis of fully understanding the basic theory of wireless sensor networks and analyzing the principles of existing cluster routing algorithms,in order to improve network energy utilization and optimize routing methods,two improved algorithms are proposed.The work content of the thesis is as follows:(1)In order to solve the problems of unreasonable cluster head distribution and high energy consumption in the uniform clustering routing algorithm,this thesis proposes an energy heterogeneous uniform based on edge distance factor cluster routing algorithm.This algorithm introduced an edge distance factor to reduce the probability of an edge node being elected as the cluster head.At the same time,considering the influence of distance,energy and node density on the distribution of cluster heads,the threshold formula was improved.In the route construction process,the node bearing index was introduced to optimize the route method.Through the simulation results,it can be known that the algorithm can reasonably distribute the cluster heads,prolong the network life cycle,and increase the data transmission volume.(2)In order to solve the problems of uneven energy consumption and unreasonable relay node selection in the non-uniform clustering routing algorithm,this thesis proposes a kind of energy heterogeneity based on the forwarding cluster head non-uniform clustering routing algorithm.The algorithm selected candidate cluster heads according to the improved threshold formula.The node energy consumption index and node density factor were introduced to optimize the competition radius mechanism and select the cluster head.And optimized the clustering mechanism,at the same time,selected the forwarding cluster head to separate data collection and forwarding.During the route construction process,the quality parameters of the relay nodes were set to optimize the multi-hop route.The simulation results show that the algorithm can reduce network energy consumption,stabilize the number of cluster heads,and extend the life cycle of the network.