This letter proposes an efficient joint resource allocation scheme for OFDMbased cooperative cognitive radio networks (CRNs) under various practical limitations. Compared with those traditional approaches, which guarantee the transmission rates of cognitive users, the proposed scheme ensures that cognitive users are maintained in proportion to the predefined target rates. Numerical simulation shows that the proposed scheme can achieve a reasonable tradeoff between performance and computational complexity.
1. Introduction
C
ognitive radio (CR) technology has been proposed to improve the spectrum utilization and provide adaptability for wireless transmission on licensed spectrums
[1

3]
. The performance of secondary users (SUs) and the spectrum utilization can be further improved by incorporating cooperative communications and orthogonal frequency division multiplexing (OFDM) technology
[4

7]
.
By utilizing the intrinsic flexibility of OFDM in power allocation across subcarriers, a lot of work has already been done on the resource allocation in noncognitive relay systems
[8

10]
. However, the resource allocation in OFDMbased cooperative CRNs is more complex than that in a conventional OFDM system because cognitive transmission should protect the communication of primary users (PUs). Its purpose is to optimize the resources so that the CRN’s throughput is maximized while the interference induced to the primary system is kept below the prespecified threshold. Recently, the resource allocation for OFDMbased cooperative CRNs has attracted much attention
[11]

[14]
. In
[11]
, the resource allocation problem with proportional fairness rate in cognitive OFDMbased wireless network is studied, it achieves a good performance and proportional fairness rate among SUs. In
[12]
, the dual decomposition and subgradient methods are used to find the optimal solution and a genetic algorithm is presented to obtain a suboptimal approach. The work in
[13]
proposes an improved joint subcarrier and bit allocation scheme for cognitive radio networks. These studies achieve some results, however, they considers limited practical constraints and take only some kinds of resources allocation into consideration. In our early work, an efficient resource allocation algorithm has been proposed in the paper
[14]
, which considers the amplifyandforward (AF) relaying and adopts a twostep approach to achieve the pairing among subcarriers, optimal relay selection and power allocation. However, the work in
[14]
is difficult to be directly used in the scene of this letter. By distributing the available total power equally among the subcarriers in both source and destination and assuming that every subcarrier induces the same amount of interference to the PUs,
[15]
solves the above problems at a suboptimal performance. Additionally,
[15]
performes subcarrier pairing and power allocation in a sequential manner for all subcarriers. When a given subcarrier in the source side is paired with another one in the destination side, the latter cannot be used any more for the next steps. Hence, the order of the subcarrier assignment process may slightly degrade the algorithm performance.
The motivation for this letter is twofold. Firstly, since the allocated subcarriers may not support the required rates for practical applications, it is important to guarantee that the rate of each subcarrier is not below a certain threshold. Secondly, the resource allocation problem is often formulated as a mixed integer programming task and the general algorithms (such as: dual decomposition algorithm) are been used to address the problem. However, these general algorithms almost have high complexity. It will affect the CRN’s overall throughput because the communication time of SUs is reduced while the resource allocation time is large. In addition, even if the algorithm complexity is low, the CRN’s overall throughput will be affected while the resource allocation algorithm performs poorly. As a consequence, it is valued to propose an efficient resource allocation algorithm that can achieve a good tradeoff between the system performance and the computational complexity. The main contributions of this letter can be summarized as follows: 1) compared to conventional methods, more practical system limitations are considered; 2) enjoying the low and constant computational complexity in given radio scenarios, the proposed algorithm can approximate the performance of the optimal solution and meet the requirement of practical communication systems.
2. System Model and Problem Formulation
 2.1 System Model
Consider an OFDMbased cooperative CRN as shown in
Fig. 1
, where SUs coexist with the primary system in a same geographical region. Due to the existence of obstacles or long distances, the source and the destination lack direct communication link. Therefore,
M
relays are deployed to assist the cognitive communications. The frequency band
B
of CRN is divided into
N
subcarriers, and the bandwidth of each subcarrier is Δ
f
. Meanwhile, the CRN can utilize primary bandwidths under the condition that its interference to PU is lower than the interference threshold
I_{th}
. Each relay
m
,
m
∈ [1,...,
M
] , operates in a halfduplex mode decodeandforward (DF) manner over a subcarrier pair (
j
,
k
), i.e., the subcarrier
j
of the source SU and the subcarrier
k
of the destination SU.
System model of OFDMbased cooperative cognitive radio network
In an OFDMbased CRN, the interference from the
i^{th}
subcarrier of SU to the PU can be formulated as
[16]
:
where
d_{i}
represents the spectral distance between the
i^{th}
subcarrier and the PU band,
G_{i}
denotes the square of the channel gain between the
i^{th}
subcarrier and the PU band.
P_{i}
is the transmission power emitted by the
i^{th}
subcarrier,
T_{s}
is the symbol duration, and
ρ_{i}
denotes the interference factor of the
i^{th}
subcarrier to the PU band. Meanwhile, as shown in (2), the interference power induced by a PU signal with power spectrum density
ϑ
(
e^{jw}
) into the
i^{th}
subcarrier can be formulated as an additive white Gaussian noise (AWGN) by applying the law of large number or by assuming independent and random Gaussian codewords by PU and SU
[17

18]
For the channel between the source SU and the
m^{th}
relay (resp. the
m^{th}
relay to the destination SU), denote the square of the channel coefficient over the
j^{th}
(
resp.k^{th}
) subcarrier as
H_{j,m}
(
resp.H_{m,k}
), the transmission power over this subcarrier as
P_{j,m}
(
resp.P_{m,k}
), and AWGN~
CN
(0,
σ
^{2}
_{AWGNj,m(m,k)}
). The achivable communication rate over the subcarrier pair (
j
,
m
,
k
) can be evaluated by
where
σ
^{2}
_{j,m(m,k)}
=
σ
^{2}
_{AWGNj,m(m,k)}
+
J_{j(k)}
.
σ
^{2}
_{AWGNj,m(m,k)}
is the variance of the AWGN on the source to the
m^{th}
relay (
m^{th}
relay to destination) link and
J_{j(k)}
is the interference introduced by the PU signal into the
j^{th}
(
k^{th}
) subcarrier.
 2.2 Problem Formulation
Our objective is to maximize the CRN’s throughput by optimizing the subcarrier pairing, relays assignment, and the distribution of the available power among the assigned subcarrier pairs, while satisfying multiple practical constraints. Therefore, the optimization problem can be formulated as follows
where
P_{s}
and
P_{m}
are the available power of the source SU and the
m^{th}
relay respectively.
I_{th}
denotes the interference threshold prescribed by PU while
R_{th}
is the rateguarantee threshold.
ρ_{j}
and
ρ_{m,k}
are the
j^{th}
(
k^{th}
) subcarrier interference factors to the PU band from the source SU and the
m^{th}
relay respectively. The interference factor in the first time slot depends only on the source SU subcarrier index and the interference factor in the second time slot depends on the destination SU subcarrier index as well as the assigned relay. In addition,
φ
_{(j, m)}
= 1 if the
j^{th}
subcarrier from the source is paired with the
m^{th}
relay and
φ
_{(j, m)}
= 0 otherwise, while
ϕ
_{(m, k)}
= 1 if the
m^{th}
relay receives the signal on the
j^{th}
subcarrier of the source SU and retransmits it on the kth subcarrier of the destination SU, and
ϕ
_{(m, k)}
= 0 otherwise. In practice, the channel gains between the SUs can be obtained by classical channel estimation techniques, while the channel gains between the SUs and PU can be obtained by estimating the received primary signal power based on the prior knowledge of primary transmit power levels and channel reciprocity
[19]

[22]
.
As a mixed binary integer programming problem, the duality gap of (4) is asymptotically zero for sufficiently large
N
[23]
, and we can solve the dual problem of (4) to obtain the asymptotically optimal solution for (4). However, this solution incurs a high computational complexity for the resource allocation algorithm. To remedy this, the next section will propose an efficient joint resource allocation algorithm.
3. Proposed Resource Allocation Algorithm
In order to decrease the computational complexity without sacrificing system performance, we propose a novel heuristic algorithm, which jointly considers subcarrier pairing, relay assignment and power allocation. For the simplicity of further description, define the sets
L_{1}
= {(
j
,
m
) 
φ
_{(j, m)}
= 1},
L_{2}
= {(
j
,
m
) 
φ
_{(j, m)}
= 0} and
L_{3}
= {(
m
,
k
) 
ϕ
_{(m, k)}
= 1}. Without loss of generality, assume the noise variance to be constant for all subcarriers and users, i.e.
σ
^{2}
_{j,m}
=
σ
^{2}
_{m,k}
=
σ
^{2}
.
In the proposed resource allocation algorithm, the total power and interference constraints of source SU and each relay are divided into
T
portions i.e. Δ
P
=
P_{s}
/
T
,
=
P_{m}
/
T
, Δ
I
=
I_{th}
/
T
. For every power portion, we search over all the subcarriers and relays to find out the best subcarrier pair (
j
^{*}
,
m
^{*}
,
k
^{*}
).
Table 1
summarizes the details of the proposed algorithm. Step 1 initializes all the variables and step 2 accomplishes the joint power allocation, relay assignment and subcarrier pairing. For a given power portion (min (Δ
p
, Δ
I
/
ρ_{j}
)) of the source SU, step 2(a) achieves the pairing among the subcarriers and all relays and gets the best link (
j
^{*}
,
m
^{*}
). According to the chosen best relay
m
^{*}
, step 2(b) assigns the best subcarrier in destination SU to get the ultimate best communication link (
j
^{*}
,
m
^{*}
,
k
^{*}
) for the given power portion (min (
, Δ
I
/
ρ_{m*,k}
,
)) in the best relay
m
^{*}
, where
is the power threshold obtained by letting the rate achieved in the link between the best relay
m
^{*}
and the destination SU equal to that in the link between
j
^{*}
to
m
^{*}
. Finally, step 3 guarantees the transmission rate for satisfying the QoS requirement of cognitive communication.
Joint resource allocation algorithm
Joint resource allocation algorithm
For the proposed efficient algorithm, every iteration requires no more than
MN
^{2}
function evaluations.Therfore, the complexity of the proposed algorithm is
O
(
TMN
^{2}
) where
T
is always not big. For the optimal solution that obtaines by using dual decomposition technique and subgradient methods,
MN
^{2}
function evaluations are performed to find the power allocation in every iteration. Afterwards,
M
function evaluations are performed for every possible subcarrier pair where there are
N
^{2}
different subcarrier pairs. By including the computational complexity of the Hungarian method, the optimal algorithm has a complexity of
O
(
S
(
MN
^{2}
) +
N
^{3}
) where
S
is the number of iterations required to converge and is usually large value. We can find the complexity of
[15]
is
O
(
MN
^{2}
) in the reference.
4. Simulation results
In this section, we demonstrate the performance of the proposed resource allocation algorithm using Monte Carlo simulation over 1000 realizations. We compare the proposed algorithm with the other two schemes: the optimal solution and the scheme in
[15]
, where the optimal solution is obtained by using the dual decomposition technique and subgradient methods. In all simulations, the channel gains are obtained from independent Rayleigh distributed random variables with mean equal to 1.
Ts
,
B
,
M
,
N
and
σ
^{2}
are assumed to be 5μs, 20MHz, 5, 64 and 0.0001 respectively. The parameters in the simulations are described in
Table 2
.
Simulation parameters
Fig. 2
shows the achieved overall throughput of the different algorithms vs. the available power budgets. One can notes that the overall throughput grows with the increase of power budgets as the CRN become able to use more power on the different subcarriers. It is worth noticing that our proposed algorithm performs much better than the scheme in
[15]
and the gap between the proposed algorithm and the optimal solution is very small, suggesting that the proposed scheme provides a good approximation to the optimal. Additionally, the gaps among the proposed algorithm and the other two schemes are very close in the high power budgets region. This is because that the interference induced to the primary system should be kept below the prespecified threshold to ensure the QoS of PUs.
Overall throughput vs. available power budgets with P_{s} = P_{m} .
Fig. 3
depicts the achieved overall throughput of the different algorithms vs. the interference constraint. It can be found that our proposed algorithm outperforms the scheme in
[15]
and achieves a near optimal performance with much less computational complexity. Additionally, we can observe that the overall throughput grows with the increase of interference threshold, and all the algorithms have a near performance in the low interference threshold region. Furthermore, the gaps among the proposed algorithm with the other two schemes are increased with the interference threshold increased.
Overall throughput vs. allowed interference threshold.
From
Fig. 4
, we can see that the overall throughput decreases as rateguarantee threshold grows for all the algorithms. This is because that the rate provided by some allocated subcarriers may be too low for practical usage. In order to ensure communication requirement, these poor quality links are discarded. In addition, we can observe that our proposed algorithm performs much better than the scheme in
[15]
and the gap between the proposed algorithm and the optimal solution is very small, suggesting that the proposed scheme provides a good approximation to the optimal.
Overall throughput vs. rateguarantee threshold.
Fig. 5
illustrates the overall throughput of the proposed scheme vs. the values of “T”. It can be found the overall throughput increases with the values of “T”. However, with the increase of “T”, the system performance improvement amount will gradually decrease when “T” increases to a certain extent.
Overall throughput vs. the values of “T”.
Fig. 6
plots the overall throughput of the proposed schemes vs. different interference threshold and power constraint to clarify the different regions. By fixing one of the constraints, it can be found that the overall throughput increases with the other up to a certain point, and the change of the constraint value does not affect the overall throughput when the value exceed the certain point.
Overall throughput vs. different interference threshold and power constraint.
Compare to general algorithms (such as: dual decomposition algorithm, genetic algorithm), the proposed algorithm has a much smaller complexity while performs excellently that makes it scalable. In addition, the simulation results show that multiple simulations have similar optimal solution. It suggests that the proposed algorithm has a good stability.
5. Conclusion
In this paper, a LowComplexity high performance resource allocation algorithm is investigated that jointly considers subcarrier pairing, best relay selection and power allocation scheme. The proposed algorithm shows to perform closely to the optimal solution with much less complexity, Moreover, the proposed algorithm outperforms the scheme in
[15]
and has a good scalability and stability.
BIO
Xuezhou Yang was born in Nanchong, China. He is currently working towards the Ph.D. degree in National Key Laboratory of Science and Technology on Communications at University of Electronic Science and Technology of China, Chengdu, China. His research interests span the broad area of wireless communication and networks, cooperative communication system. Recently, he has been working on the cooperative spectrum sensing in cognitive radio network, and resource allocation for OFDMbased cognitive radio networks.
Wei Tang received his B.S., M.S. and Ph.D. degrees in Communication and information system from University of Electronic Science and Technology of China, Chengdu, China. He currently works in National Key Laboratory of Science and Technology on Communications at University of Electronic Science and Technology. His research interest includes wireless communication and networks, cooperative communication system.
Wei Guo received his B.S. and M.S. degrees from University of Electronic Science and Technology of China, Chengdu, China. He currently works in National Key Laboratory of Science and Technology on Communications at University of Electronic Science and Technology of China as a professor. His research interest includes wireless communication and networks, Satellite and space communications technology, software systems and medical systems and telecare/telehealth networks.
Miltola J.
,
Maguire G. Q.
1999
“Cognitive radio: Making software radios more personal”
IEEE Peronal. Commun
Article (CrossRef Link)
6
(4)
13 
18
DOI : 10.1109/98.788210
Xu Z.
,
Qin W.
,
Tang Q.
2014
“Energyefficient Cognitive Access Approach to Convergence Communications”
SCIENCE CHINA Information Sciences
Article (CrossRef Link)
57
(4)
1 
12
DOI : 10.1007/s1143201450810
Zou Yulong
,
Yao YuDong
,
Zheng Baoyu
2011
“A selectiverelay based cooperative spectrum sensing scheme without dedicated reporting channels in cognitive radio networks”
IEEE Trans. Wireless Communication
Article (CrossRef Link)
10
(4)
1188 
1198
DOI : 10.1109/TWC.2011.021611.100913
Zou Yulong
,
Yao YuDong
,
Zheng Baoyu
2012
“Cooperative relay techniques for cognitive radio systems: Spectrum sensing and secondary user tran smissions”
IEEE Communications Magazine
Article (CrossRef Link)
50
(4)
98 
103
DOI : 10.1109/MCOM.2012.6178840
Zou Yulong
,
Yao YuDong
,
Zheng Baoyu
2011
“Cognitive transmissions with multiple relays in cognitive radio networks”
IEEE Trans. Wireless Communication
Article (CrossRef Link)
10
(2)
648 
659
DOI : 10.1109/TWC.2010.120610.100830
Zhong Bin
,
Zhang Zhongshan
2013
“Partial Relay Selection with FixedGain Relays and Outdated CSI in Underlay Cognitive Networks”
IEEE Trans. Veh. Technol
Article (CrossRef Link)
10
(6)
100 
110
Stevenson Carl. R
,
Chouinard Gerald
,
Zhong Lei
2009
“IEEE 802.22: The first cognitive radio wireless regional area network stand”
IEEE Communications Magazine
Article (CrossRef Link)
47
(1)
130 
138
DOI : 10.1109/MCOM.2009.4752688
Li W.
,
Delicatob F.
,
Pires P.
2014
“Efficient allocation of resources in multiple heterogeneous Wireless Sensor Networks”
Journal of Parallel and Distributed Computing
Article (CrossRef Link)
74
(1)
1775 
1788
DOI : 10.1016/j.jpdc.2013.09.012
Yaru Fu.
,
Qi Zhu.
2013
“A joint resource allocation scheme for relay enhanced multicell orthogonal frequency division multiple networks”
KSII Transactions on Internet and Information Systems
Article (CrossRef Link)
7
(2)
288 
307
DOI : 10.3837/tiis.2013.02.007
Linshu Lv.
,
Qi Zhu.
2013
“Joint relay selection and resource allocation for cooperative OFDMA network”
KSII Transactions on Internet and Information Systems
Article (CrossRef Link)
6
(11)
3008 
3025
ZhengYi Chai.
,
DeXian Zhang.
,
SiFeng Zhu.
2012
” Resource allocation with proportional rate in cognitive wireless network: an immune clonal optimization scheme”
KSII Transactions on Internet and Information Systems
Article (CrossRef Link)
6
(5)
1286 
1302
Alsharoa Ahmad
,
Bader Faouzi
,
Alouini MohamedSlim
2013
“Relay selection and resource allocation for twoway DFAF cognitive radio networks”
IEEE Wireless Communication Letters
Article (CrossRef Link)
2
(4)
427 
430
DOI : 10.1109/WCL.2013.051513.130211
Xu Xiaorong
,
Yao YuDong
,
Hu Sanqing
,
Yao Yingbiao
2013
“Joint Subcarrier and Bit Allocation for Secondary User with Primary Users’ Cooperation”
KSII Transactions on Internet and Information Systems
Article (CrossRef Link)
7
(12)
3037 
3054
DOI : 10.3837/tiis.2013.12.005
Yang Xuezhou
,
Tang Wei
,
Guo Wei
2014
” Efficient Resource Allocation with Multiple Practical Constraints in OFDMbased Cooperative Cognitive Radio Networks”
KSII Transactions on Internet and Information Systems
Article (CrossRef Link)
8
(7)
2350 
2364
Shaat Musbah
,
Bader Faouzi
2012
“Asymptotically optimal resource allocation in OFDMbased cognitive networks with multiple relays”
IEEE Trans. Wireless Communication
Article (CrossRef Link)
11
(3)
892 
897
DOI : 10.1109/TWC.2012.011012.110880
Weiss T.
,
Hillenbrand J.
2004
“Mutual interference in OFDMbased spectrum pooling systems”
in Proc. of 2004 IEEE Vehicular Technology ConferenceSpring
vol.4, Article (CrossRef Link)
1873 
187
Bansal G.
,
Hossain M. J.
,
Bhargava V. K.
2008
“Optimal and suboptimal power allocation schemes for OFDMbased cognitive radio systems”
IEEE Trans. Wireless Commun
Article (CrossRef Link)
7
(11)
4710 
4718
DOI : 10.1109/TWC.2008.07091
Cover T. M.
,
Thomas J. A.
2006
“Elements of Information Theory, 2nd edition”
John Wiley and Sons
Zhang Zhongshan
,
Zhang Wei
,
Tellambura C
2009
“Cooperative OFDM Channel Estimation in the Presence of Frequency Offsets”
IEEE Trans. Veh. Technol
Article (CrossRef Link)
58
(7)
3447 
3459
DOI : 10.1109/TVT.2009.2016345
Zhang Zhongshan
,
Zhang Wei
,
Tellambura C
2009
“OFDMA uplink frequency offset estimation via cooperative relaying”
IEEE Trans. Wireless Commun
Article (CrossRef Link)
8
(9)
4450 
4456
DOI : 10.1109/TWC.2009.081525
Zhang Zhongshan
,
Zhang Wei
,
Tellambura C
2008
“MIMOOFDM Channel Estimation in the Presence of Frequency Offsets”
IEEE Trans. Wireless Commun
Article (CrossRef Link)
8
(9)
2329 
2339
DOI : 10.1109/TWC.2008.070044
Zhang R.
,
Cui S.
,
Liang Y.C.
2009
“On ergodic sum capacity of fading cognitive multipleaccess and broadcast channels”
IEEE Trans. Inf. Theory
Article (CrossRef Link)
55
(11)
5161 
5178
DOI : 10.1109/TIT.2009.2030449
Yu W.
,
Lui R.
2006
“Dual methods for nonconvex spectrum optimization of multicarrier systems”
IEEE Trans. Commun.
Article (CrossRef Link)
54
(7)
1310 
1322
DOI : 10.1109/TCOMM.2006.877962