计算机与现代化
計算機與現代化
계산궤여현대화
Computer and Modernization
2015年
10期
77-82
,共6页
认知无线电%动态频谱分配%频谱拍卖%NSGA-II%多背包问题
認知無線電%動態頻譜分配%頻譜拍賣%NSGA-II%多揹包問題
인지무선전%동태빈보분배%빈보박매%NSGA-II%다배포문제
cognitive radio%dynamic spectrum allocation%spectrum auction%NSGA-II%multi-knapsack problem
认知无线电中,频谱拍卖是解决动态频谱分配的有效方法,其主要目的是最大化所有主用户的收益。然而,主用户间的收益是存在冲突的,给拍卖算法的优化带来了困难。为此,提出一种新的拍卖方案,来解决获胜者确定问题( Winner Determination Problem, WDP)。在该方案中,动态频谱拍卖问题被建模成多背包问题,并通过非支配排序遗传算法II ( NSGA-II)得到最终的解决方案。最后,仿真实验结果表明,就解决WDP问题而言,与贪心算法相比,NSGA-II算法有更好的表现。
認知無線電中,頻譜拍賣是解決動態頻譜分配的有效方法,其主要目的是最大化所有主用戶的收益。然而,主用戶間的收益是存在遲突的,給拍賣算法的優化帶來瞭睏難。為此,提齣一種新的拍賣方案,來解決穫勝者確定問題( Winner Determination Problem, WDP)。在該方案中,動態頻譜拍賣問題被建模成多揹包問題,併通過非支配排序遺傳算法II ( NSGA-II)得到最終的解決方案。最後,倣真實驗結果錶明,就解決WDP問題而言,與貪心算法相比,NSGA-II算法有更好的錶現。
인지무선전중,빈보박매시해결동태빈보분배적유효방법,기주요목적시최대화소유주용호적수익。연이,주용호간적수익시존재충돌적,급박매산법적우화대래료곤난。위차,제출일충신적박매방안,래해결획성자학정문제( Winner Determination Problem, WDP)。재해방안중,동태빈보박매문제피건모성다배포문제,병통과비지배배서유전산법II ( NSGA-II)득도최종적해결방안。최후,방진실험결과표명,취해결WDP문제이언,여탐심산법상비,NSGA-II산법유경호적표현。
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 prob-lem ( 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 sol-ving the problem of WDP compared with the greedy algorithm.