基于用户需求的图着色论频谱分配算法  

Spectrum allocation algorithm of graph coloring theory based on user requirement

作　　者：瞿越[1] 鲜永菊[1,2] 徐昌彪[2] 

机构地区：[1]重庆大学通信工程学院,重庆400044 [2]重庆邮电大学移动通信重点实验室,重庆400065

出　　处：《计算机应用》2011年第3期602-605,共4页journal of Computer Applications

基　　金：国家自然科学基金资助项目(60972068);重庆市教育委员会科学技术研究项目(KJ090502);重庆大学研究生科技创新基金重点资助项目(200904B1A0010306)

摘　　要：对最新的图着色论频谱分配算法进行了分析,针对认知用户需求未得到满足的缺点,提出用户满意度,根据它来设置频谱分配优先级函数,对需求满足情况较差的用户优先进行分配,得到一种基于用户需求的图着色论频谱分配算法。仿真结果表明,提出的算法能增加系统信道效益,更好地满足多个用户的信道需求,提高了频谱利用率。This paper analyzed the latest spectrum allocation algorithms of graph coloring theory. Concerning the shortage of the cognitive users＇ requirement not being satisfied, the user-satisfaction was proposed. Based on it, the authors set the spectrum allocation priority function. And the users, whose need was not well satisfied, were preferentially assigned. A spectrum allocation algorithm of graph coloring based on the requirement was obtained. The simulation results show that the proposed algorithm can enhance the system＇s channel efficiency, meet the needs of multiple users＇ bandwidth requirements better, and improve the spectrum efficiency.

关 键 词：频谱复用 用户需求 优先级 信道效益 

分 类 号：TN915[电子电信—通信与信息系统] TP393.01[电子电信—信息与通信工程]