计算机工程 ›› 2010, Vol. 36 ›› Issue (06): 210-212.doi: 10.3969/j.issn.1000-3428.2010.06.071

• 人工智能及识别技术 • 上一篇    下一篇

基于混合蛙跳算法的认知无线电频谱分配

彭 振1,赵知劲1,2,郑仕链1   

  1. (1. 杭州电子科技大学通信工程学院,杭州 310018;2. 中国电子科技集团公司第36研究所通信系统信息控制技术国家级重点实验室,嘉兴 314033)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-03-20 发布日期:2010-03-20

Cognitive Radio Spectrum Assignment Based on Shuffled Frog Leaping Algorithm

PENG Zhen1, ZHAO Zhi-jin1,2, ZHENG Shi-lian1   

  1. (1. College of Communication Engineering, Hangzhou Dianzi University, Hangzhou 310018; 2. State Key Lab of Information Controlling Technology in Communications System, No. 36 Research Institute, China Electronic Technology Corporation, Jiaxing 314033)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-03-20 Published:2010-03-20

摘要: 提出一种二进制混合蛙跳算法和基于该算法的认知无线电频谱分配方法。对该方法与颜色敏感图论着色算法进行仿真比较,结果表明在最大化网络总效益和最大化公平效益准则下,基于二进制混合蛙跳算法的频谱分配方法的性能较高。二进制混合蛙跳算法能找到理想最优解,颜色敏感图论着色算法得到的解与理想最优解偏差较大。

关键词: 认知无线电, 动态频谱分配, 混合蛙跳, 图论着色

Abstract: This paper presents a binary shuffled frog leaping algorithm and an assignment method for cognitive radio spectrum based on it. Simulations are conducted to compare this method and color sensitive graph coloring algorithm. Results show that under the maxmization rule of whole network efficiency and fairness efficiency, the assignment method for cognitive radio based on binary shuffled frog leaping algorithm has higher performance. The binary shuffled frog leaping algorithm can find the ideal optimal solutions while the solution obtained by color sensitive graph coloring algorithm has a large deviation with the optimal solutions.

Key words: cognitive radio, dynamic spectrum assignment, shuffled frog leaping, graph coloring

中图分类号: