Joint Subchannel Pairing and Power Control for Cognitive Radio Networks with Amplify-and-Forward RelayingReport as inadecuate

Joint Subchannel Pairing and Power Control for Cognitive Radio Networks with Amplify-and-Forward Relaying - Download this document for free, or read online. Document in PDF available to download.

The Scientific World JournalVolume 2014 2014, Article ID 380106, 10 pages

Research Article

Department of Mechanical and Biomedical Engineering, City University of Hong Kong, Kowloon, Hong Kong

Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, Guangdong Province 518000, China

Shandong Academy of Agricultural Machinery Sciences, Jinan, Shandong Province 250000, China

Received 2 December 2013; Revised 30 April 2014; Accepted 20 May 2014; Published 15 June 2014

Academic Editor: Juncheng Jia

Copyright © 2014 Yanyan Shen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Dynamic spectrum sharing has drawn intensive attention in cognitive radio networks. The secondary users are allowed to use the available spectrum to transmit data if the interference to the primary users is maintained at a low level. Cooperative transmission for secondary users can reduce the transmission power and thus improve the performance further. We study the joint subchannel pairing and power allocation problem in relay-based cognitive radio networks. The objective is to maximize the sum rate of the secondary user that is helped by an amplify-and-forward relay. The individual power constraints at the source and the relay, the subchannel pairing constraints, and the interference power constraints are considered. The problem under consideration is formulated as a mixed integer programming problem. By the dual decomposition method, a joint optimal subchannel pairing and power allocation algorithm is proposed. To reduce the computational complexity, two suboptimal algorithms are developed. Simulations have been conducted to verify the performance of the proposed algorithms in terms of sum rate and average running time under different conditions.

Author: Yanyan Shen, Shuqiang Wang, and Zhiming Wei



Related documents