Research On Maximal Weighted Independent Set Based Graph Coloring Spectrum Allocation Algorithm In Cognitive Radio Network

As a spectrum sharing wireless communication technology, cognitive radio network can effectively solve the current shortage of radio spectrum resources. Spectrum allocation technique is one of the key technology in cognitive radio network, this paper makes a deep research to it and puts forward an improved maximal weighted independent set based graph coloring spectrum allocation algorithm in cognitive radio network.This paper introduces the dynamic resource allocation and some typical spectrum allocation models in cognitive radio network firstly, and then the advantages and disadvantages has been discussed and simulation results are given among the three algorithms, which is, list-coloring algorithms, color sensitive graph coloring algorithm and the spectrum allocation algorithm based on maximal independent set.The list-coloring algorithm and color-sensitive graph coloring algorithm can only be assigned one spectrum to the corresponding user in a distribution cycle, while maximal independent set algorithm can assign a channel to multiple users simultaneously, but it did not consider the differences in benefit. Based on above shortcomings, the paper proposes an improved graph coloring algorithm based on maximal weighted independent set. The improved algorithm fully considered the benefits in the process of distribution and by using the power control technology, it ensures the signal to interference plus noise ratio at the receivers when allocating a spectrum to multiple users simultaneously.The simulation result verifies that with the use of power control technology, it improves the spectrum utilization rate and achieves better system reward with acceptable level of communication reliability.Finally, the full text has been summarized and the spectrum allocation algorithm in cognitive radio network is prospected.