计算机工程
計算機工程
계산궤공정
COMPUTER ENGINEERING
2010年
6期
210-212,217
,共4页
认知无线电%动态频谱分配%混合蛙跳%图论着色
認知無線電%動態頻譜分配%混閤蛙跳%圖論著色
인지무선전%동태빈보분배%혼합와도%도론착색
cognitive radio%dynamic spectrtun assignment%shuffled frog leaping%graph coloring
提出一种二进制混合蛙跳算法和基于该算法的认知无线电频谱分配方法.对该方法与颜色敏感图论着色算法进行仿真比较,结果表明在最大化网络总效益和最大化公平效益准则下,基于二进制混合蛙跳算法的频谱分配方法的性能较高.二进制混合蛙跳算法能找到理想最优解,颜色敏感图论着色算法得到的解与理想最优解偏差较大.
提齣一種二進製混閤蛙跳算法和基于該算法的認知無線電頻譜分配方法.對該方法與顏色敏感圖論著色算法進行倣真比較,結果錶明在最大化網絡總效益和最大化公平效益準則下,基于二進製混閤蛙跳算法的頻譜分配方法的性能較高.二進製混閤蛙跳算法能找到理想最優解,顏色敏感圖論著色算法得到的解與理想最優解偏差較大.
제출일충이진제혼합와도산법화기우해산법적인지무선전빈보분배방법.대해방법여안색민감도론착색산법진행방진비교,결과표명재최대화망락총효익화최대화공평효익준칙하,기우이진제혼합와도산법적빈보분배방법적성능교고.이진제혼합와도산법능조도이상최우해,안색민감도론착색산법득도적해여이상최우해편차교대.
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.
