Heuristic Spectrum Assignment Algorithm in Distributed Cognitive Networks

Li Yu, Cong Liu, Zuhao Liu, Wenyu Hu

.

DOI: 10.4236/wsn.2010.26053                

Abstract

Cognitive radio is an exciting emerging technology that has the potential of dealing with the urgent requirement and scarcity of the radio spectrum. Although having multiple radio interfaces and available spectrum bands can generally increase the effective throughput, a problem arises as to what the best strategy to dynamically assign available bands to secondary users for maximizing throughput by minimizing the interference, and what the best scheme to allocate the spectrum holes to unlicensed users to maximize the fairness. This paper presents a distributed and heuristic spectrum assignment algorithm for multi-radio wireless cognitive networks in a cognitive network environment. The proposed algorithm (Fairness Bargaining with Maximum throughput, FBMT) considers the problems including system throughput and the fairness. Extensive simulation studies in 802.11 based multi-radio cognitive networks have been performed. The results indicate that the proposed algorithm can facilitate a large increase in network throughput and acquire a good fairness performance in comparison with a common spectrum assignment mechanism that is used as a benchmark in the literature.

Keywords

Cognitive Network, Distributed Spectrum Assignment, Throughput, Fairness, FBMT

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1]	S. W. Ellingson, “Spectrum Occupancy at VHF: Implications for Frequency-Agile Cognitive Radios,” Proceedings of IEEE Vehicle Technologies Conference, Vol. 9, No. 2, 2005, pp. 1379-1382.
[2]	M. A. McHenry, “NSF Spectrum Occupancy Measurements Project Summary,” Shared Spectrum Company Report, Vienna, 2005.
[3]	M. McHenry, E. Livsics, T. Nguyen and N. Majumdar, “XG Dynamic Spectrum Access Field Test Results,” IEEE Communications Magazine, Vol. 6, No. 45, 2007, pp. 51-57.
[4]	J. Mitola and G. Q. Maguire, “Cognitive Radio: Making Software Radios More Personal,” IEEE Personal Communications, Vol. 8, No. 6, 1999, pp. 13-18.
[5]	H. Zheng and C. Peng, “Collaboration and Fairness in Opportunistic Spectrum Access,” Proceedings of the 2005 IEEE International Conference on Communications (ICC’05), Seoul, Korea, 2005, pp. 3132-3136.
[6]	C. Peng, H. Zheng and B. Y. Zhao, “Utilization and Fairness in Spectrum Assignment for Opportunistic Spec- trum Access,” Mobile Networks and Applications, Vol. 11, No. 4, 2006, pp. 555-576.
[7]	J. Zhao, H. Zheng and G. Yang, “Distributed Coordination in Dynamic Spectrum Allocation Networks,” Proceedings of the 2005 1st IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN’05), Baltimore, 2005, pp. 259-268.
[8]	L. Cao and H. Zheng, “Distributed Spectrum Allocation Via Local Bargaining,” Proceedings of the 2nd Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, Santa Clara, 2005, pp. 475-486.
[9]	X. Liu and W. Wang, “On the Characteristics of Spectrum-Agile Communication Networks,” Proceedings of the 2005 1st IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySP- AN’05), Baltimore, 2005, pp. 214-223.
[10]	W. Wang and X. Liu, “List-Coloring Based Spectrum Allocation for Open-Spectrum Wireless Networks,” Proceedings of the IEEE International Symposium on Vehicular Technology (VTC’05-Fall), Dallas, 2005, pp. 690-694.
[11]	Y. Xing, R. Chandramouli, S. Mangold and S. N. Shankar, “Analysis and Performance Evaluation of a Fair Spectrum Access Protocol for Open Spectrum Wireless Networks,” Proceedings of the 2005 IEEE International Symposium on Communications (ICC’05), Seoul, Korea, 2005, pp. 1179-1183.