Improved Algorithm of Spectrum Allocation Based on Graph Coloring Model in Cognitive Radio

Abstract

Cognitive radio technology is proposed to solve the problem of the scarce radio spectrum resources. In view of the spectrum allocation in cognitive radio technology, this paper first analyses the three allocation rules based on graph coloring theory which include the sum reward rules, the max-min reward rules and the proportional-fair reward rules. The simulations of the three algorithms adopt the average user-reward. And we can gain the optimal rule among the three rules by the comparing simulation. This paper also proposes an improved algorithm based on graph coloring theory. The simulation results indicate that the proposed algorithm can reduce the computation effectively and have no effect on the system reward.

A Service-Oriented Spectrum Assignment Algorithm for Cognitive Wireless Networks

“…In [12] one algorithm considering the bandwidth matching between secondary users' bandwidth requirements and the available channels was proposed to improve the total spectrum utilization provided protecting the primary users. To effectively reduce the time overhead, parallel allocation scheme was presented in [11], and an improved algorithm was provided in [13], in which the allocated node can get all the available channels at one time, but it will get worse fairness between nodes. To efficiently balance the network reward and the fairness performance, a flexible algorithm was discussed in [14].…”

Degree-Based Spectrum Management Scheme for CR Networks

“…Currently there are three directions on spectrum management according to the emphasis of research, some schemes aim to reduce the interference for primary users, since we does not consider the emergence of primary uses, so the correlative research isn't be discussed; some schemes aim to reduce the interference and improve the utilization rate of spectrum among cognitive users, the literatures (Clancy et al, 2007;Tsagkaris et al, 2008;Ghasemi, 2008;Zhi-Jin et al, 2009) allow that node selects the suitable frequency independently to reduce the interference among cognitive nodes with collecting statistical to predict the state of frequency in the future or make use of artificial intelligence technology to reason the spectrum state; some schemes suggest frequencies are allocated by the support of additional equipment, such as cognitive users acquire the frequencies from GPS or base station, such as literatures (Ileri et al, 2005;Cabric et al, 2004;Noishiki et al, 2008); some schemes in literatures (Panlong and Guihai, 2008;Wang et al, 2009) discus cognitive users have ability and cache to compute the complex algorithm and save much data based on coloring graph; others schemes are put forward indirectly in designing the protocols about cognitive radio that are also called oriented-object scheme, such as literatures (Cheng et al, 2007;Ma et al, 2007). In a word, above schemes is not advantage in the rapid application for urgency surrounding.…”

Graph-theoretic algorithm for spectrum allocation in IEEE 802.22 wireless mesh network

“…In graph-coloring model [5][6][7] , a vertex represents a user and an edge connecting two uses with interference. Different channels are mapped to different color.…”