Competitive interference-aware spectrum access in cognitive radio networks

Cognitive radio networks provide the capability to share the wireless channel with licensed (primary) users in an opportunistic manner. Primary users have a license to operate in a certain spectrum band; their access can only be controlled by the Primary Operator and is not affected by any other unlicensed (secondary) user. On the other hand, secondary users (SUs) have no spectrum license, and they attempt to exploit the spectral gaps left free by primary users. This work studies the spectrum access problem in cognitive radio networks from a game theoretical perspective. The problem is modeled as a non-cooperative spectrum access game where secondary users access simultaneously multiple spectrum bands left available by primary users, optimizing their objective function which takes into account the congestion level observed on the available spectrum bands. As a key innovative feature with respect to existing works, we model accurately the interference between SUs, capturing the effect of spatial reuse. We demonstrate the existence of the Nash equilibrium, and derive equilibrium flow settings. Finally, we provide numerical results of the proposed spectrum access game in several cognitive radio scenarios, and study the impact of the interference between SUs on the game efficiency. Our results indicate that the congestion cost functions we propose in this paper lead to small gaps between Nash equilibria and optimal solutions in all the considered network scenarios, thus representing a starting point for designing pricing mechanisms so as to obtain a socially optimal use of the network.

[1]  J. Goodman Note on Existence and Uniqueness of Equilibrium Points for Concave N-Person Games , 1965 .

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

[3]  Eitan Altman,et al.  Competitive routing in networks with polynomial costs , 2002, IEEE Trans. Autom. Control..

[4]  K. J. Ray Liu,et al.  Repeated spectrum sharing game with self-enforcing truth-telling mechanism , 2008, 2008 IEEE International Conference on Communications.

[5]  Dusit Niyato,et al.  Competitive spectrum sharing in cognitive radio networks: a dynamic game approach , 2008, IEEE Transactions on Wireless Communications.

[6]  Farhad Khozeimeh,et al.  Dynamic spectrum management for cognitive radio: an overview , 2009, Wirel. Commun. Mob. Comput..

[7]  Dusit Niyato,et al.  Competitive Pricing for Spectrum Sharing in Cognitive Radio Networks: Dynamic Game, Inefficiency of Nash Equilibrium, and Collusion , 2008, IEEE Journal on Selected Areas in Communications.

[8]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[9]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[10]  Christos H. Papadimitriou,et al.  Worst-case Equilibria , 1999, STACS.

[11]  K. J. Liu,et al.  Dynamic Spectrum Sharing : A Game Theoretical Overview , 2022 .

[12]  Ariel Orda,et al.  Competitive routing in multiuser communication networks , 1993, TNET.