By Topic

Resource Allocation in Relay-Aided OFDM 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
$31 $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

4 Author(s)
Sidhu, G.A.S. ; Sch. of Eng. & Sci., Jacobs Univ., Bremen, Germany ; Feifei Gao ; Wei Wang ; Wen Chen

In this paper, we investigate the resource allocation problem in a single-user relay-aided cognitive radio (CR) underlay network. Both the CR network and the primary network operate under the orthogonal frequency-division multiplexing (OFDM) scheme. Different from the conventional resource allocation problem, the relay node here is capable of performing subcarrier permutation over two hops such that the signal received over a particular subcarrier is forwarded via a different subcarrier. The objective is to maximize the throughput of the CR network subject to a limited power budget at the secondary source and the relay node and to interference constraints at the primary receiver. Optimization is performed under a unified framework where power allocation at the source node, power allocation at the relay node, and subcarrier pairing at the two hops are jointly optimized. The joint resource-allocation scheme yields an asymptotically optimal solution. We further design a suboptimal algorithm that sacrifices little on performance but could significantly reduce computational complexity. Finally, numerical examples are provided to corroborate the proposed studies.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:62 ,  Issue: 8 )