Research On A WSN Routing Protocol With Energy Balance

Wireless sensor networks have developed rapidly in the continuous advancement of Internet of Things technology.As one of the key technologies of wireless sensor networks,routing protocols have attracted the attention and research of many scholars.The wireless sensor network routing protocol is generally divided into a planar routing protocol and a hierarchical routing protocol.The planar routing protocol is generally based on a tree structure and is suitable for small networks.The hierarchical routing protocol has strict structural division on the sensor network,and has a low overhead.Other advantages,suitable for large networks.Although the current hierarchical routing protocol has achieved certain research results,there is still a problem of uneven energy consumption.Aiming at the problem that the closer the node is to the Sink node,the greater the energy consumption,the WSN Hierarchical Routing Protocol with Energy Balance(HRPWEB)is proposed in the current WSN routing technology.The specific implementation of the protocol can be divided into four steps: first,the flooding method establishes the neighbor node information table;second,according to the shortest hop relationship between the node and the sink node,the candidate node is elected and the candidate node competition radius is calculated,and combined Multi-factor selection of cluster head node;Third,based on the principle of virtual force,the network is constructed as a suitable cluster;Fourth,under the premise of energy balance,the cluster head node performs multiple data transmission.Compared with the current energy-balanced routing protocol,the HRPWEB routing protocol proposed in this paper pays more attention to the energy consumption balance.In the election of the cluster head candidate nodes and the calculation of the competition radius of the cluster head candidate nodes,the shortest hop count of the node distance Sink node is used as a metric,that is,when the node has the shortest hop count from the sink node,it is selected as a candidate.The smaller the probability of the node,the smaller the density of the cluster head,which also just compensates for the fact that the closer the node is to the Sink node,the greaterthe energy consumption.In the election of the cluster head,the remaining energy of the candidate node of the cluster head,the average link quality of the communication between the candidate node and the neighboring neighbor nodes,and the number of neighbor nodes are fully considered.Therefore,the elected cluster head is in communication energy and energy.The consumption balance is more representative.Finally,the shortest hops of the Sink node,the residual energy of the cluster head node,and the link quality of the cluster head node and the neighbor cluster head node are used as the influence factors to design a reasonable cost forwarding function to select the next hop forwarding node..The HRPWEB routing protocol proposed in this paper considers the balance of network energy consumption in many aspects.The simulation results show that the HRPWEB routing protocol is 55.5% lower than the LEACH in terms of network residual energy variance,and the node mortality is much lower than Greedy,LEACH and im-LEACH.