Wireless Sensor Network Routing Protocol Optimization

As a new type of information network,wireless sensor networks have special roles and significance in the fields of environmental monitoring and forecasting,medical care,military,agriculture and smart home.The main problem of sensor network energy is the initial distribution structure of the node,the network energy balance and minimize energy consumption of data collection and transmission in the process.The paper will analyze the existing models and protocols according to the following three aspects to conduct separate research and propose algorithms and simulations.1.Initial distribution of nodes:Sensor nodes are discretely distributed in a specified area.Since the nodes do not have the ability to move,the position is fixed after the layout.The LEACH protocol is based on node clustering and cluster head selection.For hierarchical clustering routing,the density of node cluster head optimization can be performed in the initial.Using k-means++,as a discrete distributed clustering machine learning algorithm,the position vector is used before the traditional routing algorithm distribution to reduce the condition that the distance between cluster heads is too far or the partial distribution of nodes is too dense,resulting in energy loss of information transmitted later.2.Energy consumption in data collection and transmission:PEGASIS is a single-link algorithm based on greedy algorithms and link transmission.Based on the iterative idea of genetic algorithm,the multi-chain processing of PEGASIS is performed with setting a threshold distance,and the appropriate proportion of the chain head node in PEGASIS is measured by fitness function to ensure the optimal routing algorithm for multi-hop transmission,thus the energy saving effect of data transmission and collection is achieved.3.Graph-based method for load balancing optimization:sensor networks can transform the transmission between nodes into a connected graph model,and perform path weighting based on distance to build a load balancing tree in a sensor network with asymmetric structure.The balance factor is derived from the Chebyshev summation inequality to evaluate the network.The balance of the routing tree generated by the algorithm is achieved by letting the node choose branch considering the load and freedom space.