Abstract
We consider a scenario where multiple Secondary Users (SUs) operate within a Cognitive Radio Network (CRN) which involves a set of channels, where each channel is associated with a Primary User (PU). We investigate two channel access strategies for SU transmissions. In the first strategy, the SUs will send a packet directly without operating Carrier Sensing Medium Access/Collision Avoidance (CSMA/CA) whenever a PU is absent in the selected channel. In the second strategy, the SUs implement CSMA/CA to further reduce the probability of collisions among co-channel SUs. For each strategy, the channel selection problem is formulated and demonstrated to be a so-called “Potential” game, and a Bayesian Learning Automata (BLA) has been incorporated into each SU so to play the game in such a manner that the SU can adapt itself to the environment. The performance of the BLA in this application is evaluated through rigorous simulations. These simulation results illustrate the convergence of the SUs to the global optimum in the first strategy, and to a Nash Equilibrium (NE) point in the second.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Liang, Y.C., Chen, K.C., Li, G.Y., Mahönen, P.: Cognitive radio networking and communications: An overview. IEEE Trans. Veh. Technol. 60(7), 3386–3407 (2011)
Narendra, K.S., Thathachar, M.A.L.: Learning automata: An introduction. Prentice-Hall (1989)
Lakshmivarahan, S.: Learning algorithms theory and applications. Springer, New York (1981)
Song, Y., Fang, Y., Zhang, Y.: Stochastic channel selection in cognitive radio networks. In: IEEE Global Telecommunications Conference, Washington DC, USA, pp. 4878–4882 (November 2007)
Tuan, T.A., Tong, L.C., Premkumar, A.B.: An adaptive learning automata algorithm for channel selection in cognitive radio network. In: IEEE International Conference on Communications and Mobile Computing, Shenzhen, China (April 2010)
Zhang, X., Jiao, L., Granmo, O.C., Oommen, B.J.: Channel selection in cognitive radio networks: A switchable Bayesian learning automata approach. In: IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, London, UK (September 2013)
Xu, Y., Wang, J., Wu, Q., Anpalagan, A., Yao, Y.-D.: Opportunistic spectrum access in unknown dynamic environment: A game-theoretic stochastic learning solution. IEEE Trans. on Wirel. Commun. 11(4), 1380–1391 (2012)
Granmo, O.C.: Solving two-armed Bernoulli bandit problems using a Bayesian learning automaton. International Journal of Intelligent Computing and Cybernetics 3(2), 207–234 (2010)
Granmo, O.C., Glimsdal, S.: Accelerated Bayesian learning for decentralized two-armed bandit based decision making with applications to the Goore game. Applied Intelligence 38(4), 479–488 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Jiao, L., Zhang, X., Granmo, OC., Oommen, B.J. (2014). A Bayesian Learning Automata-Based Distributed Channel Selection Scheme for Cognitive Radio Networks. In: Ali, M., Pan, JS., Chen, SM., Horng, MF. (eds) Modern Advances in Applied Intelligence. IEA/AIE 2014. Lecture Notes in Computer Science(), vol 8482. Springer, Cham. https://doi.org/10.1007/978-3-319-07467-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-07467-2_6
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07466-5
Online ISBN: 978-3-319-07467-2
eBook Packages: Computer ScienceComputer Science (R0)