Resource allocation in an OFDM-based cognitive radio system
Top Cited Papers
- 17 July 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 57 (7) , 1928-1931
- https://doi.org/10.1109/tcomm.2009.07.070157
Abstract
The problem of subcarrier, bit and power allocation for an OFDM based cognitive radio system in which one or more spectrum holes exist between multiple primary user (PU) frequency bands is studied. The cognitive radio user is able to use any portion of the frequency band as long as it does not interfere unduly with the PUs' transmissions. We formulate the resource allocation as a multidimensional knapsack problem and propose a low-complexity, greedy max-min algorithm to solve it. The proposed algorithm is simple to implement and simulation results show that its performance is very close to (within 0.3% of) the optimal solution.Keywords
This publication has 12 references indexed in Scilit:
- Adaptive Power Loading for OFDM-Based Cognitive Radio SystemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- Greedy algorithm for the general multidimensional knapsack problemAnnals of Operations Research, 2006
- Cognitive radio: brain-empowered wireless communicationsIEEE Journal on Selected Areas in Communications, 2005
- Spectrum pooling: an innovative strategy for the enhancement of spectrum efficiencyIEEE Communications Magazine, 2004
- An empirically based path loss model for wireless channels in suburban environmentsIEEE Journal on Selected Areas in Communications, 1999
- Multiuser OFDM with adaptive subcarrier, bit, and power allocationIEEE Journal on Selected Areas in Communications, 1999
- Cognitive radio: making software radios more personalIEEE Wireless Communications, 1999
- A Genetic Algorithm for the Multidimensional Knapsack ProblemJournal of Heuristics, 1998
- Variable-rate variable-power MQAM for fading channelsIEEE Transactions on Communications, 1997
- A heuristic solution procedure for the multiconstraint zero-one knapsack problemNaval Research Logistics (NRL), 1987