Research On Spectrum Allocation Algorithm In Cognitive Radio Network

In the era of mobile Internet,people are more and more demanding for wireless services,and their requirements for service quality are getting higher and higher,bringing the wireless communication technology into a period of rapid development.At the same time,the demand for spectrum resources is also increasing.However,the spectrum is a limited resource,the problem of shortage of spectrum resources has become increasingly prominent.In spite of this,a considerable number of studies have found that the utilization rate of the existing spectrum resources is low,even there are varying degrees of idleness and waste.The core idea of cognitive radio(CR)is to make use of various technologies to enable a large number of wireless communication devices to find "spectrum holes" and to use them fully and effectively.In this way,when the spectrum resource is short,it can make the dynamic management of the spectrum and the increase of spectrum utilization possible.This paper focuses on the spectrum allocation technology,which is the key technology in CR.Based on graph theory and game theory,this paper studies the spectrum allocation problem in CR,and the simulation experiments and results are carried out for the corresponding research results.The specific research contents and achievements are as follows:Aiming at the problem that the traditional graph coloring algorithm excessive emphasis on distribution but ignore the spectrum heterogeneity,based on the graph coloring model of spectrum allocation algorithm in cognitive radio network(CRN),this paper introduces the analytic hierarchy process of multi objective decision making.A spectrum allocation algorithm in CRN based on graph coloring model and analytic hierarchy process is proposed.By analyzing several factors that affect the quality of the spectrum,then use analytic hierarchy process to select the optimal frequency spectrum for secondary user(SU).Simulation results show that compared with the original algorithm,the proposed algorithm can effectively improve thenetwork efficiency,and has no obvious loss to the fairness of the whole networks.Combining the advantages of the two algorithms,it not only improves the efficiency of SUs,but also meets the requirements of the overall benefit of CRN,thus forming a complete framework from spectrum decision to distribution.Aiming at the problem of channel pricing for primary user(PU)in spectrum allocation of CRN,we consider the CRN with two PUs as the differential oligopolistic market in economics and adopt the Bertrand model based on price in game theory to analyze the channel pricing of PUs,and the spectrum allocation algorithm is extended under the condition that the preference parameters of SUs are normal distribution,making the algorithm more universal.The simulation shows that the channel price is closely related to the channel profit,and the system reaches Nash equilibrium by the rate adjustment parameter.When the rate adjustment parameter is appropriate,the stable channel price can be obtained in a relatively short period of time.In addition,there is a correlation between marginal cost and Nash equilibrium point.If the marginal cost becomes higher,the channel price will also increase.