Advanced graph-coloring spectrum allocation algorithm for cognitive radio

Authors:
Zhang Jian-wu;Zhao Qi;Zou Jing-yuan
Affiliations:
Telecommunication Department, Hangzhou Dianzi University, Hangzhou, Zhejiang, China;Telecommunication Department, Hangzhou Dianzi University, Hangzhou, Zhejiang, China;Telecommunication Department, Hangzhou Dianzi University, Hangzhou, Zhejiang, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 2
Cited 1

Utilization and fairness in spectrum assignment for opportunistic spectrum access

Mobile Networks and Applications
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cognitive radio can use the hole of licensed spectrum efficiently without interference to the primary users through sensing the wireless environment dynamically. An improved algorithm of spectrum allocation based on graph-coloring theory is proposed in this paper. It can significantly reduce the cost of allocating channels through parallel allocation thus enhance the extent of reusing channels but causing no interference between cognitive users. Simulation proves that the cost of this algorithm is only slightly greater than the parallel algorithm while its system reward is obviously higher than that of former algorithms. As a result it will further optimize the spectrum allocation and boost the spectrum utilization.