Research On Energy Consumption Optimization Of WSN Hierarchical Multi-Hop Routing Protocol

Wireless sensor network(WSN)can realize the collection and forwarding of large amounts of data,and is widely used in industrial control,agricultural monitoring,fault detection,medical health monitoring and other applications.However,the energy of sensor nodes is limited and difficult to supplement,which has become a key factor affecting the long-term and stable operation of WSN.Therefore,the routing protocol closely related to its energy has become one of the key research directions of WSN.In this paper,the following research work is carried out for the energy consumption of WSN routing protocol :(1)In order to achieve better clustering effect and alleviate the data pressure of cluster head,this paper proposes LEACH-K-GA protocol.The protocol analyzes and calculates the optimal number of cluster heads in the network.On this basis,the K-means algorithm is improved for network optimization clustering,which makes the network clustering more reasonable and effectively avoids the phenomenon of maximum and minimum clusters.At the same time,the weight coefficient is introduced to the threshold formula of the cluster head election,which makes the location distribution of the selected cluster head reasonable,and avoids the low energy node being selected as the cluster head,and effectively balances the network energy consumption.In order to further alleviate the data pressure of remote cluster head nodes,this paper uses genetic algorithm to adaptively partition the network area,and then plan the multi-hop transmission path between clusters.The simulation results show that compared with the existing LEACH and HEED protocols,LEACH-K-GA protocol has better network performance in clustering effect,network lifetime and network energy consumption.(2)In order to further shorten the communication distance between nodes and balance the network energy consumption,this paper proposes LEACH-C-MCT protocol.The protocol establishes the inter-cluster and intra-cluster relay cost models of nodes,and defines the relay cost of nodes.In this paper,the simulated annealing algorithm is used to select cluster heads.On this basis,the proposed multi-start minimum spanning tree algorithm is used to plan the multi-hop transmission path combined with the relay cost of nodes,so that the sum of communication costs of nodes in the network is minimized and the energy consumption of nodes is effectively balanced.In addition,in order to avoid data conflict caused by multi-hop transmission,a bottom-up TDMA continuous slot allocation method is designed.Through simulation,it can be concluded that compared with the existing LEACH,LEACH-C and LEACH-M protocols,LEACH-C-MCT protocol has better network performance in terms of network lifetime,network energy consumption and data conflict in two simulation scenarios.