Spectrum Allocation in Cognitive Radio Networks Using Evolutionary Algorithms

One of the key objectives of evolving communication technologies is to maximize the utilization of the available spectrum by increasing the number of simultaneous users while reducing interferences among users. In cognitive radio networks, this problem is referred to as the spectrum allocation problem, and is shown to be NP-Hard. This chapter studies the use of evolutionary algorithms to solve the spectrum allocation problem in cognitive radio networks. In particular, a Binary Harmony Search Algorithm (BHSA) is proposed and used, for the first time, to solve the spectrum allocation problem. The performance of the proposed BHSA algorithm is evaluated via simulation and is compared with an optimized Genetic Algorithm (GA) under three utilization functions, namely, Mean-Reward (MR), Max-Min-Reward (MMR), and Max-Proportional-Fair (MPF). Extensive simulation results confirm that the BHSA is not only faster, but it also finds better solutions compared to those obtained by the GA. For instance, under the MMR function, the BHSA requires less than 4% of the time needed by the GA in order to find a solution that is 10% better than that obtained by the GA.

[1]  Zhen Peng,et al.  Cognitive radio spectrum allocation using evolutionary algorithms , 2009, IEEE Transactions on Wireless Communications.

[2]  Abdelbaset S. Hamza,et al.  On the effectiveness of using Genetic Algorithm for spectrum allocation in cognitive radio networks , 2010, 7th International Symposium on High-capacity Optical Networks and Enabling Technologies.

[3]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[4]  Ian F. Akyildiz,et al.  A survey on spectrum management in cognitive radio networks , 2008, IEEE Communications Magazine.

[5]  Zong Woo Geem,et al.  State-of-the-Art in the Structure of Harmony Search Algorithm , 2010, Recent Advances In Harmony Search Algorithm.

[6]  Haitao Zheng,et al.  Distributed spectrum allocation via local bargaining , 2005, 2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005..

[7]  Brian M. Sadler,et al.  Dynamic Spectrum Access: Signal Processing, Networking, and Regulatory Policy , 2006, ArXiv.

[8]  F. Jondral,et al.  Dynamic and local combined pricing, allocation and billing system with cognitive radios , 2005, First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005..

[9]  Brian M. Sadler,et al.  A Survey of Dynamic Spectrum Access , 2007, IEEE Signal Processing Magazine.

[10]  Andrea Goldsmith,et al.  Wireless Communications , 2005, 2021 15th International Conference on Advanced Technologies, Systems and Services in Telecommunications (TELSIKS).

[11]  Randy L. Haupt,et al.  Practical Genetic Algorithms , 1998 .

[12]  Haitao Zheng,et al.  Collaboration and fairness in opportunistic spectrum access , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[13]  Ben Y. Zhao,et al.  Utilization and fairness in spectrum assignment for opportunistic spectrum access , 2006, Mob. Networks Appl..

[14]  Linda E. Doyle,et al.  Essentials of Cognitive Radio: Contents , 2009 .

[15]  Michael L. Honig,et al.  Auction-Based Spectrum Sharing , 2006, Mob. Networks Appl..

[16]  Cristina Comaniciu,et al.  Adaptive Channel Allocation Spectrum Etiquette for Cognitive Radio Networks , 2005, First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005..