基于用户等待时间和带宽需求的改进CSGC算法  

Improvement of CSGC algorithm based on users waiting time and bandwidth requirement

作　　者：徐金玉[1] 柳平[2] 

机构地区：[1]揭阳职业技术学院,广东揭阳522000 [2]汕头大学,广东汕头515000

出　　处：《重庆邮电大学学报（自然科学版）》2011年第4期415-421,共7页Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)

基　　金：国家自然科学基金(10971125)~~

摘　　要：从频谱资源紧缺的现状出发,通过对图论着色模型的分析,提出了基于用户等待时间和带宽需求的改进颜色敏感的图论着色(color sensitive graph coloring,CSGC)算法。该算法兼顾用户等待时间和实际带宽需求,使用户在趋于平等的机会获得频谱资源同时,最小化未满足需求总量,保证了系统的公平性,提高了系统的频谱利用率。仿真结果验证了该算法的可行性。Since the shortage of spectrum resources, paper raises a improvement based on the user waiting time and bandwidth requirement of CSGC（ color sensitive graph coloring） algorithm via the analysis of graph coloring model. The new algorithm takes into account both user waiting time and actual bandwidth requirements, so that minimize the total unsatisfied needs and users tend to equal access to spectrum resources. It ensures the fairness of the system and improves the efficiency of spectrum. Simulation results show the feasibility of the algorithm.

关 键 词：认知无线电 频谱分配 图论着色 带宽需求 

分 类 号：TN92[电子电信—通信与信息系统]