Title :
An Approach to Mobile IP Routing Based on QPSO Algorithm
Author :
Dongming, Zhao ; Kewen, Xia ; Baozhu, Wang ; Jinyong, Gao
Author_Institution :
Sch. of Inf. Eng., Hebei Univ. of Technol., Tianjin
Abstract :
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).
Keywords :
IP networks; genetic algorithms; mobile radio; particle swarm optimisation; telecommunication network routing; QPSO algorithm; basic PSO algorithm; genetic algorithm; mobile IP routing; quantum computation; quantum-behaved particle swarm optimization algorithm; Convergence; Equations; Genetic algorithms; Iterative algorithms; Mobile communication; Mobile computing; Particle swarm optimization; Quantum computing; Quantum mechanics; Routing; Mobile IP; Quantum-behaved Particle Swarm Optimization (QPSO) Algorithm; Routing Selection;
Conference_Titel :
Computational Intelligence and Industrial Application, 2008. PACIIA '08. Pacific-Asia Workshop on
Conference_Location :
Wuhan
Print_ISBN :
978-0-7695-3490-9
DOI :
10.1109/PACIIA.2008.17