Abstract
Scheduling spectrum access and allocating power and rate resources are tasks affecting critically the performance of wireless cognitive radio (CR) networks. The present contribution develops a primal-dual optimization framework to schedule any-to-any CR communications based on orthogonal frequency division multiple access and allocate power so as to maximize the weighted average sum-rate of all users. Fairness is ensured among CR communicators and possible hierarchies are respected by guaranteeing minimum rate requirements for primary users while allowing secondary users to access the spectrum opportunistically. The framework leads to an iterative channel-adaptive distributed algorithm whereby nodes rely only on local information exchanges with their neighbors to attain global optimality. Simulations confirm that the distributed online algorithm does not require knowledge of the underlying fading channel distribution and converges to the optimum almost surely from any initialization.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
The function \(\alpha\log_2(1+\gamma\frac{q}{\alpha})\) is defined at α = 0 by continuity as \(0\log_2(1+\gamma \frac{q}{0})=\lim_{\alpha \rightarrow 0}\alpha\log_2(1+\gamma\frac{q}{\alpha})=0\)
References
FCC (2002) FCC spectrum policy task force report. ET-Docket 20-135, November. FCC, Washington, DC
Peha LM (2005) Approaches to spectrum sharing. IEEE Commun Mag 43(2):10–12
Haykin S (2005) Cognitive radio: brain-empowered wireless communications. IEEE J Sel Areas Commun 23(2):201–220
Wang X, Giannakis GB, Yu Y (2007) Channel-adaptive optimal OFDMA scheduling. In: Proceedings of 41st conf. on info. sciences and systems, Johns Hopkins University, Princeton, NJ, 14–16 March 2007
Marques A, Wang X, Giannakis GB (2007) Channel-adaptive resource allocation for cognitive OFDMA radios based on limited-rate feedback. In: Proceedings of XV European sign, proceedings conference, Poznan, 3–7 September 2007 (invited)
Bertsekas DP (1999) Nonlinear programming, 2nd edn. Athena Scientific, Thousand Oaks
Robbins H, Monro S (1951) A stochastic approximation method. Ann Math Stat 22:400–407
Acknowledgements
The authors would like to thank Professors Xin Wang (Florida Atlantic University) and Antonio G. Marques (Universidad Rey Juan Carlos) for helpful discussions on extending [4] and [5] to the distributed setting; and also Yuchen Wu for his collaboration in the class project which started with the optimization problem Eq. 3, without the minimum rate constraints.
Author information
Authors and Affiliations
Corresponding author
Additional information
Prepared through collaborative participation in the Communications and Networks Consortium sponsored by the U. S. Army Research Laboratory under the Collaborative Technology Alliance Program, Cooperative Agreement DAAD19-01-2-0011. The U. S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon.
Rights and permissions
About this article
Cite this article
Bazerque, JA., Giannakis, G.B. Distributed Scheduling and Resource Allocation for Cognitive OFDMA Radios. Mobile Netw Appl 13, 452–462 (2008). https://doi.org/10.1007/s11036-008-0083-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11036-008-0083-z