| Cognitive radio is a preferred method to solve the problem of spectrum resources which attracts more and more attention. So as to spectrum allocation, an important method in the cognitive radio. Color sensitive graph coloring algorithm (CSGC) is a mature spectrum allocation algorithm which considers the location factors effect in spectrum allocation. This article is based on this model.At first, review the cognitive radio and its related technology, analysis and compares four classic spectrum allocation models. Choose graph coloring model which is close to the actual situation for subsequent research. Then, simulates and analysis four common models of graph coloring model and choose the one with better color sensitive graph coloring theory for further study.In view of the spectrum allocation fairness problem CSGC algorithm itself, scholars have put forward improved algorithm of CSGC based on waiting time and bandwidth requirements. However, at the initial stage, the influence of waiting time on algorithm fairness is relatively small. This paper improves the calculation method of waiting time, puts forward an improved CSGC algorithm based on waiting fairness (CSGC-WF), and improves the fairness of spectrum distribution algorithm. And give the flow chart and steps of the algorithm by comparing with the existing algorithm, show that the proposed algorithm in this paper, based on waiting for fairness (CSGC-WF) has a better distribution fairness.Finally, in the actual cases, the spectrum allocation fairness should take user’s own factors into account. So, this paper puts forward an improved algorithm of CSGC based on node fairness priority (CSGC-DS) Except for CSGC-WF algorithm CSGC-DS considers influence factor of throughput and bit error rate on spectrum allocation. By comparing with classic CSGC algorithm and the existing simulation experiment, prove that the proposed fusion algorithm has better distribution effect. |
PDF Full Text Request