Journal of Northeastern University ›› 2012, Vol. 33 ›› Issue (3): 336-339.DOI: -

• OriginalPaper • Previous Articles     Next Articles

Dynamic spectrum assignment based on graph coloring in cognitive radio network

Jia, Jie (1); Wang, Chuang (1); Zhang, Zhao-Yang (1); Chen, Jian (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110819, China
  • Received:2013-06-19 Revised:2013-06-19 Published:2013-04-04
  • Contact: Jia, J.
  • About author:-
  • Supported by:
    -

Abstract: Dynamic spectrum assignment scheme is an effective measure to solve the low utility of spectrum resources in cognitive radio networks. As to the "starvation" problem of cognitive users, a dynamic spectrum assignment algorithm based on graph coloring was proposed with the purpose of maximizing the system access ratio. The utility function was presented on the basis of graph coloring model, and by updating the available matrix, the allocation process could be implemented effectively. Simulation results demonstrated that the proposed algorithm can obtain a high system access ratio and achieve a good tradeoff between throughput and fairness, and it has much more superiority than the existing algorithms.

CLC Number: