Non-dominated sorting quantum particle swarm optimization and its application in cognitive radio spectrum allocation

Abstract

In order to solve discrete multi-objective optimization problems, a non-dominated sorting quantum particle swarm optimization (NSQPSO) based on non-dominated sorting and quantum particle swarm optimization is proposed, and the performance of the NSQPSO is evaluated through five classical benchmark functions. The quantum particle swarm optimization (QPSO) applies the quantum computing theory to particle swarm optimization, and thus has the advantages of both quantum computing theory and particle swarm optimization, so it has a faster convergence rate and a more accurate convergence value. Therefore, QPSO is used as the evolutionary method of the proposed NSQPSO. Also NSQPSO is used to solve cognitive radio spectrum allocation problem. The methods to complete spectrum allocation in previous literature only consider one objective, i.e. network utilization or fairness, but the proposed NSQPSO method, can consider both network utilization and fairness simultaneously through obtaining Pareto front solutions. Cognitive radio systems can select one solution from the Pareto front solutions according to the weight of network reward and fairness. If one weight is unit and the other is zero, then it becomes single objective optimization, so the proposed NSQPSO method has a much wider application range. The experimental research results show that the NSQPS can obtain the same non-dominated solutions as exhaustive search but takes much less time in small dimensions; while in large dimensions, where the problem cannot be solved by exhaustive search, the NSQPSO can still solve the problem, which proves the effectiveness of NSQPSO.

Keywords

cognitive radio / spectrum allocation / multi-objective optimization / non-dominated sorting quantum particle swarm optimization / benchmark function

References

[1] SrinivasN, DebK. Mutiobjective optimization using nondominated sorting in genetic algorithms [J]. Evolutionary Computation, 1994, 2(3): 221-248

[2] DebK, PratapA, AgarwalS, MeyarivanT. A fast and elitist nondominated sorting genetic algorithm for multiobjective optimization: NSGA II [J]. IEEE Transactions on Evolutionary Computation, 2002, 6(2): 182-197

[3] ZitzlerE, ThieleL. Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach [J]. IEEE Transactions on Evolutionary Computation, 1999, 3(3): 257-271

[4] ZitzlerE, LaumannsM, ThieleL. SPEA2: Improving the strength Pareto evolutionary algorithms [C]. Evolutionary for Design, Optimization and Control with Application to an Industrial Problems (EUROGEN2001). Barcelona, Spain, 200295-100

[5] GaoC, HuangJ-y, SunY, DiaoS-long. Particle swarm optimization based RVM classifier for non-linear circuit fault diagnosis [J]. Journal of Central South University of Technology, 2012, 19(2): 459-464

[6] Montes De OcaM A, StutzleT, BirattariM, DorigoM. Frankenstein’s PSO: A composite particle swarm optimization algorithm [J]. IEEE Transactions on Evolutionary Computation, 2009, 13(5): 1120-1132

[7] CoinA. Ant colony algorithms [J]. Dr Dobb’s Journal, 2006, 31(9): 46-51

[8] EslamiM, ShareefH, MohamedA. Power system stabilizer design using hybrid multi-objective particle swarm optimization with chaos [J]. Journal of Central South University of Technology, 2011, 18(5): 1579-1588

[9] ZhangJ, ChungH S H, LoA W L, HuangTao. Ended ant colony optimization algorithm for power electronic circuit design [J]. IEEE Transactions on Power Electronics, 2009, 24(1): 147-162

[10] HeyT. Quantum computing: An introduction [J]. Computing & Control Engineering Journal, 1999, 10(3): 105-112

[11] HanK H, KimJ H. Quantum-inspired evolutionary algorithm for a class of combinatorial optimization [J]. IEEE Transactions on Evolutionary Computation, 2002, 6(6): 580-593

[12] JiaoL-c, LiY-y, GongM-g, ZhangX-rong. Quantum-inspired immune clonal algorithm for global optimization [J]. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 2008, 38(5): 1234-1253

[13] HanK H, KimJ H. Genetic quantum algorithm and its application to combinatorial optimization problems [C]. Proceedings of the 2000 IEEE Conference on Evolutionary Computation, 2000PiscatawayIEEE Press1354-1360

[14] ZhangG-x, GheorgheM, WuC-zhong. A quantum-inspired evolutionary algorithm based on P systems for knapsack problem [J]. Fundamenta Informaticae, 2008, 87(1): 93-116

[15] ZhaoZ-j, PengZ, ZhengS-l, ShangJ-na. Cognitive radio spectrum allocation using evolutionary algorithms [J]. IEEE Transactions on Wireless Communications, 2009, 8(9): 4421-4425

[16] LiB-b, WangLin. A hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling [J]. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 2007, 37(3): 576-591

[17] GaoH-y, CaoJ-l, DiaoMing. A simple quantum-inspired particle swarm optimization and its application [J]. Information Technology Journal, 2011, 10(12): 2315-2321

[18] AkyildizI F, LeeW, VuranM C, MohantyS. Next generation/dynamic spectrum access/cognitive radio wireless networks: A survey [J]. Computer Networks, 2006, 50(13): 2127-2159

[19] HaykinS. Cognitive radio: Brain-empowered wireless communications [J]. IEEE Journal on Selected Areas in Communications, 2005, 23(2): 201-220

[20] NiyatoD, HossainE. Competitive spectrum sharing in cognitive radio networks: A dynamic game approach [J]. IEEE Transactions on Wireless Communications, 2008, 7(7): 2651-2660

[21] HuangJ, BerryR, HoningM L. Auction-based spectrum sharing [J]. ACM Mobile Networks and Applications (MONET), 2006, 11(3): 405-418

[22] SurisJ E, DasilvaL A, HanZ, MackenzieA B, KomaliR S. Asymptotic optimality for distributed spectrum sharing using bargaining solutions [J]. IEEE Transactions on Wireless Communications, 2009, 8(10): 5225-5237

[23] ZhengH-t, PengC-yi. Collaboration and fairness in opportunistic spectrum access [C]. Proc of 40th Annual IEEE International Conference on Communications (ICC), 2005Seoul, KoreaIEEE Communications Society3132-3136

[24] PengC-y, ZhengH-t, ZhaoB Y. Utilization and fairness in spectrum assignment for opportunistic spectrum access [J]. ACM Mobile networks and Applications (MONET), 2006, 11(4): 555-576

[25] CarlosC A C, PulidoG T, LechugaM S. Handling multiple objectives with particle swarm optimization [J]. IEEE Transactions on Evolutionary Computation, 2004, 8(3): 256-279