Spectrum allocation algorithm of graph coloring theory based on user requirement
QU Yue1,XIAN Yong-ju2,XU Chang-biao3
1. College of Communication Engineering, Chongqing University, Chongqing 400044, China 2. College of Communication Engineering, Chongqing University, Chongqing 400044, China; Key Laboratory of Mobile Communications, Chongqing University of Posts and Telecommunications, Chongqing 400065, China 3. Key Laboratory of Mobile Communications, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
Abstract：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.
2011, Vol. 31 
