Research On Energy Optimization Algorithm For Wireless Sensor Networks

Wireless sensor network consists of a lot of sensing nodes with sensing and communication capabilities.These sensor nodes monitor the area where they are located and pass the information collected from the monitoring area to users.It's a network communication technology which can collect,process and transmit information.With the continuous advancement of 5G technology,people's demand for digital information has exploded,and the application of wireless sensor networks is becoming more and more extensive.However,batteries provide energy for wireless sensor network's nodes,which have limited energy,so these nodes'survival time can't meet requirements.In order to solve the energy problem of WSN,the routing protocol for each sensor network node in WSN to exchange information is one of the key research directions.At first,this paper introduces the research background and significance of wireless sensor networks.Secondly,explains the architecture and node structure of WSN.Thirdly,analyzes wireless sensor network's key technologies.Finally,we analysis some classic routing protocols,summarize these protocols respective advantages and shortcomings,and compare the performance differences between LEACH protocol and stable election protocol(SEP).AS the SEP protocol does not take the remaining energy of nodes into consideration when electing cluster heads,this paper proposes the concept of relative remaining energy and adds this factor to the cluster head election formula,Which reduces the probability of nodes with low residual energy being selected as cluster heads,and increases the probability of selecting nodes with high residual energy as cluster heads.The SEP protocol's member nodes send the collected information directly to the cluster head,which may be partially duplicated.Due to excessive data transmission and energy exhaustion,the cluster head may die too early.To solve this problem,we propose a data fusion scheme based on principal component analysis,which fuses the collected information according to the similarity,so that the cluster head is no longer send duplicate messages.After simulation verification,the improved method greatly improves the survival time of the node,and the amount of data sent by the cluster head is also significantly reduced,which extends the network usage time.Since the SEP protocol's cluster head uses a single-hop method to send data to the sink node,when the distance between cluster head and sink node is far,it needs to consume a lot of node energy.In order to solve this problem,an inter-cluster multi-hop routing algorithm based on Dijkstra is proposed,which find the shortest distance between the cluster head and the sink node by calculating the path weight.After simulation verification,the improved method makes the energy consumption of the nodes in the network more uniform and improves the node's survival time,has better energy optimization performance.