Home > Research > Publications & Outputs > Nash Bargaining Game Theoretic Scheduling for J...
View graph of relations

Nash Bargaining Game Theoretic Scheduling for Joint Channel and Power Allocation in Cognitive Radio Systems

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>01/2012
<mark>Journal</mark>IEEE Journal on Selected Areas in Communications
Issue number1
Number of pages12
Pages (from-to)70-81
Publication StatusPublished
<mark>Original language</mark>English


This paper proposes a new Nash bargaining solution (NBS) based cooperative game-theoretic scheduling framework for joint channel and power allocation in orthogonal frequency division multiple access cognitive radio (CR) systems. Our objectives are to maximize the overall throughput of the CR system with the protection of primary users' transmission, while guaranteeing each CR user's minimum rate requirement and the proportional fairness and efficient power distribution among CR users. Using time-sharing variable transformation, we introduce a novel method that involves Lambert-W function properties and obtain closed-form analytical solutions. A low-complexity algorithm is also developed which does not require iterative processes as usual to search the optimal solution numerically. Simulation results demonstrate that our optimal policies outperform the existing maximal rate, fixed assignment and max-min fairness, while achieving the 99.985% in average of the optimal capacity.