TY - GEN
T1 - Channel-adaptive resource allocation for cognitive OFDMA radios based on limited-rate feedback
AU - Marques, Antonio G.
AU - Wang, Xin
AU - Giannakis, Georgios B.
PY - 2007
Y1 - 2007
N2 - Tailored for the emerging class of cognitive radio networks comprising primary and secondary wireless users, the present paper deals with channel-adaptive allocation of subcarriers, rate and power resources for orthogonal frequency-division multiple access (OFDMA). Users rely on adaptive modulation and coding that they select in accordance with the limited-rate feedback they receive from the access point. The access point uses channel state information to maximize the weighted average sum-rate of the network while respecting rate and power constraints on the primary and secondary users. When the channel distribution is available, the optimal off-line allocation is obtained to benchmark performance. In addition, a simple yet optimal on-line algorithm is derived using a stochastic primal-dual approach to solve the constrained utility maximization problem formulated. Analysis and simulations corroborate that the low-complexity online recursive scheme converges to the optimal solution regardless of initialization.
AB - Tailored for the emerging class of cognitive radio networks comprising primary and secondary wireless users, the present paper deals with channel-adaptive allocation of subcarriers, rate and power resources for orthogonal frequency-division multiple access (OFDMA). Users rely on adaptive modulation and coding that they select in accordance with the limited-rate feedback they receive from the access point. The access point uses channel state information to maximize the weighted average sum-rate of the network while respecting rate and power constraints on the primary and secondary users. When the channel distribution is available, the optimal off-line allocation is obtained to benchmark performance. In addition, a simple yet optimal on-line algorithm is derived using a stochastic primal-dual approach to solve the constrained utility maximization problem formulated. Analysis and simulations corroborate that the low-complexity online recursive scheme converges to the optimal solution regardless of initialization.
UR - http://www.scopus.com/inward/record.url?scp=84863735192&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84863735192&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84863735192
SN - 9788392134022
T3 - European Signal Processing Conference
SP - 861
EP - 865
BT - 15th European Signal Processing Conference, EUSIPCO 2007 - Proceedings
T2 - 15th European Signal Processing Conference, EUSIPCO 2007
Y2 - 3 September 2007 through 7 September 2007
ER -