By Topic

Joint Resource Scheduling for Relay-Assisted Broadband Cognitive Radio Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tianxiang Luan ; Department of Automation, Tsinghua National Laboratory for Information Science and Technology, and the State Key Laboratory on Information Technology and Systems, Tsinghua University, Beijing 100084, China ; Feifei Gao ; Xian-Da Zhang

In this paper, we study resource scheduling in a relay-assisted cognitive radio network with the orthogonal frequency division multiple access (OFDMA) scheme adopted to cope with the multi-user configuration. We discuss the optimization over the relay assignment, subcarrier allocation, per-node power control, and heterogenous quality-of-service (QoS) provisioning. The discrete characters of relay assignment and subcarrier allocation lead to a mixed integer nonlinear program (MINLP) whose computational complexity grows exponentially with the number of subcarriers. In an attempt to treat this complication, an asymptotically optimal solution based on the dual-analysis framework is proposed, for which we investigate the optimality of the dual method in the two scenarios: with and without subcarrier pairing. For both cases, it is shown that zero-duality-gap is achievable and the joint scheduling problem can be solved through a series of subproblems whose closed-form solutions are found. Moreover, for the scenario without subcarrier pairing we prove that the relaxation of allocation variables does not affect global optimality, i.e., even if the allocation variables are relaxed into continuous ones, binary variables are always retrievable as optimal solutions. Numerical examples are provided to corroborate the efficiency of the proposed approach.

Published in:

IEEE Transactions on Wireless Communications  (Volume:11 ,  Issue: 9 )