Research On Routing Protocol Of Wireless Sensor Network Based On Energy Consumption Optimization

Sensor nodes in wireless sensor networks are generally deployed in special areas of the environment with limited energy.Due to the limitations of the surrounding environment,the battery of the nodes is not easy to replace.How to extend the life cycle of the nodes is an important research topic in recent years.The research shows that optimizing the network routing algorithm can effectively reduce the energy consumption of the nodes.This paper first introduces the architecture of wireless sensor network,studies and analyzes the classical clustering routing protocol LEACH,and proposes a low-power adaptive clustering layered protocol(LEACH-ED)based on energy and density,aiming at its shortcomings in clustering unevenness and random cluster head election.The residual energy and density parameters of nodes are considered comprehensively to optimize by weighting idea the simulation results show that compared with LEACH algorithm,the algorithm prolongs the death time of the first node by 19.6%,and after 500 rounds,the number of remaining nodes in the network is more than 5 times that of LEACH algorithm,which effectively improves the life cycle of the whole network.Secondly,compared with the traditional LEACH protocol,the proposed energy and density based low-power adaptive clustering layered protocol can extend the life cycle of the network to a certain extent,but after the selection of the whole cluster head node,the coverage of the cluster head overlaps higher,and the energy consumption of the cluster head node is too large in the process of receiving and transmitting data.Therefore,this problem is considered Based on the energy heterogeneity of sensor nodes and the rationality of cluster head location,a clustering located routing algorithm is proposed,which optimizes the location of cluster head under the condition of selecting the deployment strategy of heterogeneous nodes and fixed number of cluster heads,reduces the energy consumption of nodes in the cluster and prolongs the life cycle of the network,The algorithm extends the death time of the first node by 23%.When the network runs to 800 rounds,the number of remaining nodes in the network increases by 20%.It improves the energy consumption of nodes and effectively improves the life cycle of the whole network.Finally,based on the fixed number of cluster heads,the number and location of cluster heads are jointly optimized,and a clustering edge algorithm based on edge approximation is proposed,the deployment of cluster head node is carried out to use as few cluster head nodes as possible under the condition of ensuring the coverage rate.Meanwhile,the location of cluster head is optimized to reduce the total energy consumption of the network.The simulation results show that compared with the FJAPSO algorithm,the algorithm can prolong the death time of the first node by 36%,and the number of remaining nodes in the network can be more than doubled when the network runs to 1000 rounds.The energy consumption of nodes is further improved,and the life cycle of the whole network is effectively improved.