关键词:量子计算、量子遗传算法、最短路径路由、QoS路由、无线传感器网络
ABSTRACT
Quantum genetic algorithm, as the combination of the quantum computing theory and the principle of genetic algorithm, is a new global optimization algorithm, which has the characteristics of smaller population size, stronger capability in the optimization, faster convergence and shorter time in computing. As the rapid development of computer network technology, a lot of real-time multimedia applications, such as video on demand and multimedia conferencing, are applied. We must find the path that has the minimum cost from the resource node to the destination node for these applications. Multi-constrained QoS routing selection means that while the information is transmitted from the resource node to the destination node, the communication link must satisfy certain constraints, such as bandwidth, delay and the information loss ration, etc. And multi-constrained QoS routing selection has been proved to be a NP complete problem.
The dissertation makes some researches on the applications of quantum genetic algorithm on the basis of parallel quantum computation in multi-constrains QoS routing selection.
First of all, the dissertation introduces the basic principle of quantum genetic algorithm. Secondly, this paper presents a quantum genetic algorithm approach to the shortest path (SP) routing problem. Finally, this paper presents a quantum genetic algorithm approach to the QoS routing problem. The network’s width, delay and balancing the network loads have been considered. And the algorithm is applied to the Wireless Sensor Networks (WSN) for solving QoS routing. Computer simulations show that the Quantum Genetic Algorithm (QGA) exhibits a better quality of solution (route optimality) than the conventional Genetic Algorithm (GA).