Research On Energy Balanced Routing Algorithm Based On Improved Genetic Algorithm In WSN

Wireless sensor networks sense the related data of the physical world through sensor nodes,and realize the connection between these data information and network information.Therefore,wireless sensor networks are widely used in target tracking,medical care and military.Due to the uncertainty of the distributed environment of sensor nodes,it is still difficult to solve the energy supply of these nodes in real time.How to effectively reduce network energy consumption,how to balance the energy consumption of each node in the network,how to improve the efficiency of the algorithm,thus prolong the network lifetime is the main problem in wireless sensor networks.The main work of this dissertation is as follows:1.For the wireless sensor networks with fewer nodes,an improved genetic algorithm is proposed to design network routing.The algorithm selects the coding strategy suitable for routing protocols,and gives the fitness function from the perspective of saving network energy consumption to improve the efficiency of finding the optimal path.In order to increase the diversity of individual populations more effectively and save the effective energy of the network,the selection,crossover and mutation operations in the genetic algorithm are also improved accordingly,so that the optimal path to be searched is not easy to premature,and the efficiency of searching for the optimal path can be improved.And can effectively save network energy consumption.2.For the wireless sensor networks with a large number of nodes,look for the global optimal path of the network.The above-mentioned genetic algorithm has the problem of low-scale routing computing ability and premature convergence.Introduce the simplex method based on the genetic algorithm.Search for the optimal path.Because the simplex method solved the large-scale routing calculation problem in a gradient manner,the algorithm search efficiency could be effectively improved.The genetic algorithm and the simplex method are effectively combined to design the reflection,expansion and contraction operations suitable for the routing protocol,which can solve the problem that the local search ability in the genetic algorithm is poor and the algorithm is premature,so that the network can balance global and local search.Through experimental simulation,the simplex-based genetic algorithm and other algorithms proposed in this dissertation compare the calculation time of the optimal path and the network energy consumption,which effectively reduces the running time of the search optimal path and saves the energy consumption of the network.Extends the runtime of wireless sensor networks.Figure 22 table 5 reference 58...