z-logo
Premium
Resource allocation for multiuser cognitive OFDM networks with proportional rate constraints
Author(s) -
Wang Shaowei,
Huang Fangjiang,
Yuan Mindi,
Du Sidan
Publication year - 2012
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.1272
Subject(s) - computer science , cognitive radio , orthogonal frequency division multiplexing , maximization , interference (communication) , resource allocation , channel (broadcasting) , mathematical optimization , orthogonal frequency division multiple access , algorithm , telecommunications , computer network , wireless , mathematics
SUMMARY In this paper we study the resource allocation problem for the multiuser orthogonal frequency division multiplexing (OFDM)‐based cognitive radio (CR) systems with proportional rate constraints. The mutual interference introduced by primary user (PU) and cognitive radio user (also referred to secondary user, SU) makes the optimization problem of CR systems more complex. Moreover, the interference introduced to PUs must be kept under a given threshold. In this paper, the highest achievable rate of each OFDM subchannel is calculated by jointly considering the channel gain and interference level. First, a subchannel is assigned to the SU with the highest achievable rate. The remaining subchannels are always allocated to the SU that suffers the severest unjustness. Second, an efficient bit allocation algorithm is developed to maximize the sum capacity, which is again based on the highest achievable rate of each subchannel. Finally, an adjustment procedure is designed to maintain proportional fairness. Simulation results show that the proposed algorithm maximizes the sum capacity while keeping the proportional rate constraints satisfied. The algorithm exhibits a good tradeoff between sum capacity maximization and proportional fairness. Furthermore, the proposed algorithm has lower complexity compared with other algorithms, rendering it promising for practical applications. Copyright © 2011 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here