|Article number||Article ID 245673|
|Pages (from-to)||1 - 10|
|Number of pages||10|
|Journal||EURASIP Journal on Wireless Communications and Networking|
|Volume||2011 (2011), article ID 245673|
|State||Published - Feb 2011|
Resource allocation schemes for orthogonal frequency division multiple access- (OFDMA-) based cognitive radio (CR) networks that impose minimum and maximum rate constraints are considered. To demonstrate the practical application of such systems, we consider the transmission of scalable video sequences. An integer programming (IP) formulation of the problem is presented, which provides the optimal solution when solved using common discrete programming methods. Due to the computational complexity involved in such an approach and its unsuitability for dynamic cognitive radio environments, we propose to use the method of lift-and-project to obtain a stronger formulation for the resource allocation problem such that the integrality gap between the integer program and its linear relaxation is reduced. A simple branching operation is then performed that eliminates any noninteger values at the output of the linear program solvers. Simulation results demonstrate that this simple technique results in solutions very close to the optimum.
Rose publication type: Journal article
Sponsorship: The authors would like to thank the directors at Toshiba TRL and the Centre for Communications Research, Bristol, for their continued support.
- cognitive radio networks, H.264 scalable video transmission, resource allocation, orthogonal frequency division multiple access- (OFDMA-)