Research on Maximal Weighted Independent Set-Based Graph Coloring Spectrum Allocation Algorithm in Cognitive Radio Networks

The traditional graph coloring spectrum allocation algorithm takes into account the efficiency in the different spectrum, but in one allocation period, it can only be assigned one spectrum to the corresponding user. Spectrum allocation algorithm based on maximal independent set can assign a spectrum to multiple users simultaneously and does not constitute interference. However, it does not consider the efficiency in the different spectrum as well as the aggregated interference as it allocates one spectrum to multiple users simultaneously. Based on this, we propose an improved maximal weighted independent set-based graph coloring spectrum allocation algorithm in cognitive radio networks. The algorithm allocates spectrum to the nodes with maximal weighted independent set and fully considers the differences in spectral efficiency and interference spectral differences. The simulation results validates the feasibility of the algorithm, and with the usage of power control technology, it improves the spectrum utilization at the premise of ensuring the received signal to interference plus noise ratio at each intended cognitive radio receivers.