A Novel Spectrum Allocation Mechanism Based on Graph Coloring and Bidding Theory

Authors:
Yutao Liu;Guisen Xu;Xuezhi Tan
Affiliations:
-;-;-
Venue:
CINC '09 Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01
Year:
2009

Citing 0
Cited 3

A non-selfish and distributed channel selection scheme for cognitive radio ad hoc networks

Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Distributed channel selection in CRAHNs: A non-selfish scheme for mitigating spectrum fragmentation

Ad Hoc Networks
Auction-Based Throughput Maximization in Cognitive Radio Networks Under Interference Constraint

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cognitive radios (CRs) have a potential to improve spectrum utilization by enabling users to access the spectrum dynamically without disturbing licensed primary users (PUs). In this paper, we consider the spectrum allocation in wireless networks with multiple selfish secondary users (SUs) and a spectrum pool formed by underutilized spectrum of primary users. A novel spectrum allocation mechanism is proposed to obtain the overall utility of both primary and secondary users, in which graph coloring and bidding theory play an important role. Moreover, the traditional mechanisms such as distributed random and greedy algorithms are presented in this paper. The simulation results show that our proposed scheme not only have a similar performance to the optimal allocation algorithm, but also can obtain the profit of primary users.