Research Article
A Stackelberg Game for Power Control and Channel Allocation in Cognitive Radio Networks
@INPROCEEDINGS{10.4108/gamecomm.2007.2040, author={Michael Bloem and Tansu Alpcan and Tamer Basar}, title={A Stackelberg Game for Power Control and Channel Allocation in Cognitive Radio Networks}, proceedings={1st International ICST Workshop on Game theory for Communication networks}, proceedings_a={GAMECOMM}, year={2010}, month={5}, keywords={}, doi={10.4108/gamecomm.2007.2040} }
- Michael Bloem
Tansu Alpcan
Tamer Basar
Year: 2010
A Stackelberg Game for Power Control and Channel Allocation in Cognitive Radio Networks
GAMECOMM
ICST
DOI: 10.4108/gamecomm.2007.2040
Abstract
The ongoing growth in wireless communication continues to increase demand on the frequency spectrum. The current rigid frequency band allocation policy leads to a significant under-utilization of this scarce resource. However, recent policy changes by the Federal Communications Commission (FCC) and research directions suggested by the Defense Advanced Research Projects Agency (DARPA) have been focusing on wireless devices that can adaptively and intelligently adjust their transmission characteristics, which are known as cognitive radios. This paper suggests a game theoretical approach that allows master-slave cognitive radio pairs to update their transmission powers and frequencies simultaneously. This is shown to lead to an exact potential game, for which it is known that a particular update scheme converges to a Nash Equilibrium (NE). Next, a Stackelberg game model is presented for frequency bands where a licensed user has priority over opportunistic cognitive radios. We suggest a modification to the exact potential game discussed earlier that would allow a Stackelberg leader to charge a virtual price for communicating over a licensed channel. We investigate virtual price update algorithms for the leader and prove the convergence of a specific algorithm. Simulations performed in Matlab verify our convergence results and demonstrate the performance gains over alternative algorithms.