Research On Energy Balanced Algorithms In Wireless Sensor Network

As the core technology of the Internet of Things,wireless sensor network has been widely used in various fields.However,due to the limited energy of sensor nodes and difficult application environment conditions,it is difficult to charge sensor nodes,so the life cycle of wireless sensor networks is restricted by node energy.In order to remedy this defect,many researchers have proposed routing algorithms that efficiently utilize the energy of sensor nodes and reduce network energy consumption.However,most of these algorithms have the problem of unbalanced energy consumption,which leads to the rapid exhaustion of energy of some nodes and shorter network life cycle.Therefore,it has become an important research issue in WSN field to reduce network energy consumption and balance energy consumption among nodes.A novel Improved Genetic Based Clustering Routing Algorithm named ICRGA is proposed to solve the problem of unbalanced energy consumption in fixed base station scenarios.ICRGA firstly uses the density peak clustering algorithm to determine the number of clusters and the initial cluster centers,so that clusters are evenly distributed in the network.Secondly,the fuzzy C-means algorithm is used to divide clusters,so that the sum of the distance between nodes and the center of clusters in the network is the shortest.Meanwhile,the nodes at the junction of clusters are dynamically adjusted to balance the number of nodes in each cluster.In order to balance the energy consumption of nodes in the cluster,several candidate cluster heads are selected and the cluster heads are rotated reasonably.Finally,an adaptive genetic algorithm is proposed to find the multi-hop route between clusters with low energy consumption and load balance.Aiming at the problem of unbalanced energy consumption in mobile base station scenarios,this paper proposes an energy balanced dynamic path construction algorithm named EBDPC for mobile base station.The EBDPC algorithm considers the node energy and the distance to the docking point set,so as to ensure that the forwarding load of the low energy node is low and more sensor nodes can be traversed within a limited path length range.EBDPC algorithm divides the network running time into several rounds,and each round includes three stages:initialization of network,selection of data collection points and construction of mobile path.The minimum spanning tree with fixed base station as the root is constructed in the initial network stage.Then,in the stopping point selection stage,the entropy weight method is used to select the nodes with low residual energy,large forwarding load and close distance to the stopping points set.Finally,the moving path is constructed in polynomial time.Simulation results show that ICRGA and EBDPC algorithms can effectively balance node energy consumption and prolong network life cycle.