Adaptive Gradient-Based Methods for Adaptive Power Allocation in OFDM-Based Cognitive Radio Networks
A gradient-based method is designed for power allocation in orthogonal-frequency-division-multiplexing (OFDM) -based cognitive radio networks. The resource allocation problem subject to a mutual interference constraint is considered. We utilize the gradient descent approach to allocate power to subc...
Saved in:
Published in | IEEE transactions on vehicular technology Vol. 63; no. 2; pp. 836 - 848 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
New York, NY
IEEE
01.02.2014
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
ISSN | 0018-9545 1939-9359 |
DOI | 10.1109/TVT.2013.2272804 |
Cover
Summary: | A gradient-based method is designed for power allocation in orthogonal-frequency-division-multiplexing (OFDM) -based cognitive radio networks. The resource allocation problem subject to a mutual interference constraint is considered. We utilize the gradient descent approach to allocate power to subcarriers in cognitive radio (CR) networks. The proposed gradient-based power allocation method with a well-designed step size can approximate the optimal solution within a few iterations. Due to the derived equation for power allocation in an adaptive manner, the proposed method is feasible for adaptive power allocation in time-varying channels. The analysis for the selection of the step size is presented in this paper. For comparison purposes, a greedy power-loading method requiring numerous iterations is also designed for this power allocation problem. The proposed gradient-based method and the greedy power-loading method both have a computational complexity of O(N), but the proposed gradient-based method requires far fewer iterations. As demonstrated in the simulation results, the proposed gradient-based method with the adaptive step size has a fast rate to achieve a near-optimal solution within an extremely small number of iterations and has quite a low computational complexity of O(N). |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
ISSN: | 0018-9545 1939-9359 |
DOI: | 10.1109/TVT.2013.2272804 |