Research On Routing Method Of Wireless Sensor Network

Wireless sensor network routing method is key techniques of wireless sensor network research. Wireless sensor network routing method refers to in wireless networks information transfer, using appropriate routing protocol after according to a certain algorithm to determine the information transmission way. Routing algorithm requirement is flexible, speed, power consumption is small, strong anti-jamming capability, so as to make wireless sensor network operating in route choice at best.Wireless sensor network routing method directly affects the entire network energy equilibrium, it will produce effective transmission of information of great significance.One of a good optimized algorithm is a key part of WSN path optimization algorithms, can short period of time in a relatively results in a more excellent way transmission scheme. Aiming at the path optimization algorithm this paper has made as follows. Firstly, based on original algorithm it puts forward the improved genetic algorithm and improvement of simulated annealing algorithm. Secondly, combined with wireless sensor node transmission characteristics and genetic algorithm and simulated annealing algorithm advantages, it proposes wireless sensor path optimization algorithm which is based on the improved genetic simulated annealing algorithm.The benefits of using genetic algorithm to find the path optimization on the routing problem is less information, strong fitness value and good convergence speed, but its easy appear precocious phenomena. The simulated annealing algorithm is simulated solid materials melting to eventually crystallization process. After proof, the advantage of the presented method is as long as the initial temperature high enough, enough slow cooling process, the algorithm can find the global optimal solution which is in 1 probability convergence. But this algorithm running time will be very long so we cannot even patience.To resolve the path optimization problem, an improved genetic annealing algorithm (GASA) that adopts adaptive optimal preservation is proposed. It uses LEACH algorithm to construct an initial routing table, uses an efficient search algorithm GASA , therefore the routing calculation and genetic evolutionary computation will executed at the same time, and the path optimization process won't stop until the approximate optimal path were find.. This algorithm combines the Maintaining Optima Saved Genetic Algorithm (MOSGA) and Simulated Annealing (SA) algorithm, and the adaptive probability changes to the mutation, which effectively solutes the matter of premature and time.The simulation experiments show that, under the same conditions, the algorithm effectively solve the routing problem in wireless sensor networks, it has a positioning accuracy, energy and has strong ability of searching. The premise of keeping the convergence speed it has been improved the algorithm convergence efficiency, and has a good result.