12,000

We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK

93%

93% of Lancaster students go into work or further study within six months of graduating

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

« Back

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

Research output: Contribution to journalJournal article

Published

Journal publication date01/2012
JournalIEEE Journal on Selected Areas in Communications
Journal number1
Volume30
Number of pages12
Pages70-81
Original languageEnglish

Abstract

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.