The Community for Technology Leaders
Pacific-Asia Workshop on Computational Intelligence and Industrial Application, IEEE (2008)
Dec. 19, 2008 to Dec. 20, 2008
ISBN: 978-0-7695-3490-9
pp: 667-671
Genetic algorithm get local optimal solution too easily and converge slowly on selection problem of mobile IP routing, in order to solve the optimization problem, an approach based on quantum-behaved particle swarm optimization algorithm (QPSO) is proposed, the approach take advantages of quantum computation such as strongly parallel calculating abilities, global convergence and rapidly operating speed. The main processes include: initialize speed and position of particles representing status of every link, then calculate fitness function to ensure the shortest path between mobile host and communication side, and renew the position of particle swarm on the evolutionary law of quantum-behaved particle swarm, finally find the shortest routing between source node and target node .Practical application indicates that the approach to mobile IP routing based on QPSO algorithm is of high precision and fast optimization speed, the effect is superior to that of approach based on genetic algorithm and basic PSO algorithm (BPSO).
Mobile IP, Routing Selection, Quantum-behaved Particle Swarm Optimization (QPSO) Algorithm

Z. Dongming, G. Jinyong, X. Kewen and W. Baozhu, "An Approach to Mobile IP Routing Based on QPSO Algorithm," 2008 Pacific-Asia Workshop on Computational Intelligence and Industrial Application. PACIIA 2008(PACIIA), Wuhan, 2008, pp. 667-671.
87 ms
(Ver 3.3 (11022016))