Distributed Resource Allocation for Cognitive Radio Networks With Spectrum-Sharing Constraints
This paper presents new design formulations that aim at optimizing the performance of an orthogonal frequency-division multiple-access (OFDMA) ad hoc cognitive radio network through joint subcarrier assignment and power allocation. Aside from an important constraint on the tolerable interference ind...
Saved in:
Published in | IEEE transactions on vehicular technology Vol. 60; no. 7; pp. 3436 - 3449 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
New York, NY
IEEE
01.09.2011
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This paper presents new design formulations that aim at optimizing the performance of an orthogonal frequency-division multiple-access (OFDMA) ad hoc cognitive radio network through joint subcarrier assignment and power allocation. Aside from an important constraint on the tolerable interference induced to primary networks, to efficiently implement spectrum-sharing control within the unlicensed network, the optimization problems considered here strictly enforce upper and lower bounds on the total amount of temporarily available bandwidth that is granted to individual secondary users. These new requirements are of particular relevance in cognitive radio settings, where the spectral activities of primary users are highly dynamic, leaving little opportunity for secondary access. A dual decomposition framework is then developed for two criteria (throughput maximization and power minimization), which gives rise to the realization of distributed solutions. Because the proposed distributed protocols require very limited cooperation among the participating network elements, they are particularly applicable to ad hoc cognitive networks, where centralized processing and control are certainly inaccessible. In this paper, we recommend that the network collaboration is made possible through the implementation of virtual timers at individual secondary users and through the exchange of pertinent information over a common reserved channel. It is shown that not only is the computational complexity of the devised algorithms affordable but that the performance of these algorithms in practical scenarios attains the actual global optimum as well. The potential of the proposed approaches is thoroughly verified by asymptotic complexity analysis and numerical results. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
ISSN: | 0018-9545 1939-9359 |
DOI: | 10.1109/TVT.2011.2157845 |