Realization of routing in mobile IP based on genetic algorithm
暂无分享,去创建一个
Due to the excellent performance in optimum problem, we choose the genetic algorithm to realize the routing algorithm via designated node in mobile IP protocol. In order to get the shortest routing via home agent from the correspondent node to the mobile node, we introduced three schemes into the algorithm. Detachment of the population and bi-direction development in selection strategy could make the diversity of population abundant. In addition, the restriction on passing the designated node in the first population initialization and crossover operation gave a better efficiency to the algorithm. Thus, results show that the proposed method was to be proved useful for routing problem via designated node.
[1] Chang Wook Ahn,et al. A genetic algorithm for shortest path routing problem and the sizing of populations , 2002, IEEE Trans. Evol. Comput..
[2] Miki Haseyama,et al. A new genetic algorithm for routing the shortest route via several designated points , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).