TY - GEN
T1 - Distributed scheduling and resource allocation for cognitive OFDMA radios
AU - Bazerque, Juan Andres
AU - Giannakis, Georgios B.
PY - 2007
Y1 - 2007
N2 - 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 (OFDMA) 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.
AB - 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 (OFDMA) 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.
UR - http://www.scopus.com/inward/record.url?scp=51349127355&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51349127355&partnerID=8YFLogxK
U2 - 10.1109/CROWNCOM.2007.4549822
DO - 10.1109/CROWNCOM.2007.4549822
M3 - Conference contribution
AN - SCOPUS:51349127355
SN - 1424408156
SN - 9781424408153
T3 - Proceedings of the 2nd International Conference on Cognitive Radio Oriented Wireless Networks and Communications, CrownCom
SP - 343
EP - 350
BT - Proceedings of the 2nd International Conference on Cognitive Radio Oriented Wireless Networks and Communications, CrownCom
T2 - 2nd International Conference on Cognitive Radio Oriented Wireless Networks and Communications, CrownCom
Y2 - 1 August 2007 through 3 August 2007
ER -