Lancaster EPrints

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

Ni, Qiang and Zarakovitis, Charilaos C. (2012) Nash Bargaining Game Theoretic Scheduling for Joint Channel and Power Allocation in Cognitive Radio Systems. IEEE Journal on Selected Areas in Communications, 30 (1). pp. 70-81. ISSN 0733-8716

Full text not available from this repository.

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.

Item Type: Article
Journal or Publication Title: IEEE Journal on Selected Areas in Communications
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments:
ID Code: 59071
Deposited By: ep_importer_pure
Deposited On: 10 Oct 2012 09:10
Refereed?: Yes
Published?: Published
Last Modified: 23 Jul 2014 15:06
Identification Number:
URI: http://eprints.lancs.ac.uk/id/eprint/59071

Actions (login required)

View Item