计算机与现代化

• 网络与通信 • 上一篇    下一篇

基于NSGA-II算法的认知无线电频谱分配

  

  1. (1.南京航空航天大学计算机科学与技术学院,江苏 南京 210016; 2.南京军区南京总医院,江苏 南京 210002)
  • 收稿日期:2015-04-02 出版日期:2015-10-10 发布日期:2015-10-10
  • 作者简介:王茵梦(1990-),女,山东东营人,南京航空航天大学计算机科学与技术学院硕士研究生,研究方向:计算机网络; 王松青(1981-),男,山东栖霞人,南京军区南京总医院工程师,博士,研究方向:通信网络安全; 杜庆伟(1974-),男,河南郑州人,副教授,硕士生导师,博士,研究方向:计算机网络。
  • 基金资助:
    国家自然科学基金资助项目(61202350)

Spectrum Allocation for Cognitive Radio Based on NSGA-II

  1. (1. College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China;
    2. Nanjing General Hospital of Nanjing Military Command, Nanjing 210002, China)
  • Received:2015-04-02 Online:2015-10-10 Published:2015-10-10

摘要: 认知无线电中,频谱拍卖是解决动态频谱分配的有效方法,其主要目的是最大化所有主用户的收益。然而,主用户间的收益是存在冲突的,给拍卖算法的优化带来了困难。为此,提出一种新的拍卖方案,来解决获胜者确定问题(Winner Determination Problem, WDP)。在该方案中,动态频谱拍卖问题被建模成多背包问题,并通过非支配排序遗传算法II (NSGA-II)得到最终的解决方案。最后,仿真实验结果表明,就解决WDP问题而言,与贪心算法相比,NSGA-II算法有更好的表现。

关键词: 认知无线电, 动态频谱分配, 频谱拍卖, NSGA-II, 多背包问题

Abstract: Spectrum auction is an effective way to solve the dynamic spectrum allocation in cognitive radio networks. The main objective in an auction is to maximize all the primary users’ revenues. However, there are some conflicts among primary users’ gains and this brings difficulties to do the auction. So, a new auction scheme is proposed to solve the winner determination problem (WDP). In the scheme, the dynamic spectrum allocation is regarded as multi-knapsack problem and trying to solve it by non-domination sort genetic algorithm II (NSGA-II). Finally simulation experiments show that NSGA-II does a good job in solving the problem of WDP compared with the greedy algorithm.

Key words: cognitive radio, dynamic spectrum allocation, spectrum auction, NSGA-II, multi-knapsack problem

中图分类号: