Research Of The Improved Genetic Algorithm In The Routing Of Mobile IP

In the process of mobile IP communication, the data packages need to pass many designed points for ensuring the node's mobility; and the mobile IP with particular traits and features needs a routing scheme differing from that of fixed network to achieve a minimal agent switch delay of mobile node.To solve the routing problem of passing many designed points in mobile IP, an improved Genetic Algorithm is brought forward. In order to decrease the size of population and the chromosome's length, the solution in feasible region of the routing problem is separated to several sections by designed points. The method is used to transform a complex routing problem to several sub problems, and the shortest routing problem of passing many designed points can be solved by solving sub problems. This algorithm is proved by a random network model, and the experimental result shows that it is effective to solve the problem of passing many designed points.The problem of switching agent of mobile node is optimized by the algorithm above. Firstly, several factors that affect the switching delay are presented, and the optimized model is built. Then the mechanism of Simulated Annealing is import in the algorithm above to decrease the execution time and quickens the velocity of convergence. According to the experimental results, the Genetic Algorithm with Simulated Annealing has less time to converge.From analyses above, the network simulation tools are used to simulate the agent's switching process of mobile node. The simulation result shows that the algorithm proposed is able to achieve excellent result to a certain extent.