# Throughput-Delay Trade-Off for Cognitive Radio Networks: A Convex Optimization Perspective

Authors: Hang Hu; Hang Zhang; Hong Yu
Journal: Abstract and Applied Analysis
 (2014)

---

## Abstract

The throughput-delay trade-off problem for cooperative spectrum sensing (CSS) is investigated. It is proved that the maximum achievable throughput and the minimum transmission delay cannot be obtained simultaneously. An efficient algorithm is proposed to optimize the sensing bandwidth and the final decision threshold jointly such that the throughput is maximized while the delay is constrained. It is demonstrated that convex optimization plays an essential role in solving the problem in an efficient way. Simulation results show that the proposed optimal scheme can significantly improve the throughput of the secondary users (SUs) under the constraint that the delay Quality of Service (QoS) requirements of the SUs are satisfied.


---

## Body

## 1. Introduction

Cognitive radio (CR) is a potential technology to improve the spectrum efficiency by allowing the secondary users to temporarily utilize the unused licensed spectrum of the primary users (PUs) [1, 2]. Efficient and effective spectrum sensing is required to guarantee the QoS of both PU and SU [3–5]. To mitigate the impact of fading and shadowing, a variety of cooperative spectrum sensing methods (e.g., [6–10]) have been proposed. Authors in [11] consider CSS when two SUs collaborate via relaying scheme. In [12], the SU throughput of a sensing-based CR system with Markovian traffic is analyzed and optimized.In the frame structure of CSS [13–15], the SU must cease transmission during the sensing slot. Thus, the transmission delay will be long, and the QoS will not be guaranteed for delay sensitive applications. To achieve continuous spectrum sensing, authors in [16–18] split the PU spectrum band into K subbands and allocate one subband exclusively for detection purposes. In the new CSS frame structure shown in [19], the SUs conduct spectrum sensing and data transmission simultaneously over two different parts of the primary user spectrum band. In this way, the SUs do not need to cease transmission in the spectrum sensing stage, and the QoS can be guaranteed.In this paper, we study the throughput-delay trade-off problem for CSS with the new frame structure. It is proved that the maximum throughput and the minimum transmission delay cannot be obtained simultaneously. Our object is to design the sensing parameters to maximize the throughput of the SUs under the constraint that the delay QoS requirements of the SUs are satisfied.We focus on optimizing the sensing bandwidth and the final decision threshold jointly such that the throughput is maximized while the delay is constrained. An efficient algorithm is proposed to obtain the optimal scheme. It is demonstrated that convex optimization plays an essential role in solving the associated design problems. Simulation results show that different delay QoS requirements require different values of sensing bandwidth. The throughput of the SUs can be greatly improved by using the proposed optimal scheme.The rest of this paper is organized as follows. In Section2, the mathematical formulation of the throughput-delay trade-off problem with new CSS frame structure is presented. Section 3 is devoted to the analysis of throughput-delay trade-off from a convex optimization perspective. Simulation results are provided in Section 4. Finally, in Section 5, we present the conclusion.


## 2. Problem Formulation

In CSS, consider the case that the SUs know the PU transmission bandwidthW. It was shown that authors in [19] proposed a new CSS frame structure in which W is divided into two parts. As depicted in Figure 1, W
s is assigned exclusively for spectrum sensing and sensing results reporting, W
t is assigned exclusively for potential SU data transmission, and W
s
+
W
t
=
W. To implement the new CSS frame structure, the SU transmitter is equipped with two radios, one for spectrum sensing and the other for data transmission. When the sensing result in the previous frame indicated that the PU was absent, the SU is allowed to transmit data. Otherwise, the SU keeps silent to protect the PU. Suppose that the frame duration is T and the individual reporting duration is T
r. Since each SU continues spectrum sensing after sending its sensing result to the fusion center (FC), the sensing duration for each SU is T
s
=
T
-
T
r.Figure 1
New frame structure for CSS.Considering that energy detection is employed to detect the status of PU in the local sensing step, the false alarm and detection probabilities at each SU are [18]
(1)
𝒫
fa
=
𝒬
(
ϵ
2
T
s
W
s
-
2
T
s
W
s
)
,
𝒫
de
=
𝒬
(
ϵ
(
1
+
γ
)
2
T
s
W
s
-
2
T
s
W
s
)
,
where ϵ is the energy detection threshold and γ is the SNR of PU’s signal at each SU. The false alarm probability is related to the detection probability as follows:
(2)
𝒫
fa
=
𝒬
(
(
1
+
γ
)
𝒬
-
1
(
𝒫
de
)
+
γ
2
T
s
W
s
)
.Suppose that the counting rule is employed in FC; then, the final false alarm and detection probabilities are [20]
(3)
Q
fa
=
∑
i
=
k
N
‍
(
N
i
)
(
𝒫
fa
)
i
(
1
-
𝒫
fa
)
N
-
i
,
Q
de
=
∑
i
=
k
N
‍
(
N
i
)
(
𝒫
de
)
i
(
1
-
𝒫
de
)
N
-
i
,
where N is the number of SUs and k is the final decision threshold at FC.There are two possible scenarios for which the SU can transmit its data. Scenario 1: the PU is correctly detected to be absent. The probability of scenario 1 happening is(
1
-
Q
fa
)
𝒫
(
H
0
), where 𝒫
(
H
0
) is the probability of absence of PU. In this scenario, the normalized achievable throughput of the SUs will be (
(
W
-
W
s
)
/
W
)
C, where C
=
log
⁡
2
(
1
+
γ
s
) and γ
s is the SNR for the secondary link [21]. Scenario 2: the PU is falsely detected to be absent; that is, missed detection occurs, and the probability of this scenario happening is (
1
-
Q
de
)
𝒫
(
H
1
), where 𝒫
(
H
1
) is the probability of presence of PU. In this scenario, the channel is occupied simultaneously by the PU and the SU to transmit data, and the normalized achievable throughput of the SUs will be (
(
W
-
W
s
)
/
W
)
C
1, where C
1
=
log
⁡
2
(
1
+
(
γ
s
/
(
1
+
γ
p
)
)
) (γ
p
=
P
p
/
N
0, where P
p is the interference power of the PU at the secondary receiver and N
0 is the noise power) [21]. The normalized achievable throughput of the SUs can be computed by
(4)
ℛ
^
=
ℛ
+
ℛ
1
,
where
(5)
ℛ
=
W
-
W
s
W
C
(
1
-
Q
fa
)
𝒫
(
H
0
)
,
ℛ
1
=
W
-
W
s
W
C
1
(
1
-
Q
de
)
𝒫
(
H
1
)
.In the new CSS frame structure, the SU transmission delay occurs in two cases: false alarm and correct detection of PU [18]. When false alarm happens, the transmission delay is
(6)
𝒟
1
=
𝒫
(
H
0
)
Q
fa
·
T
.
In the case of correct detection of PU, the delay is
(7)
𝒟
2
=
𝒫
(
H
1
)
Q
de
·
T
.
Thus, the normalized SU transmission delay is
(8)
𝒟
=
𝒟
1
+
𝒟
2
T
=
𝒫
(
H
0
)
Q
fa
+
𝒫
(
H
1
)
Q
de
.To guarantee the QoS of the SUs, maximizing the throughput of the SUsℛ
^ while minimizing the SU transmission delay 𝒟 subject to Q
de
≥
Q
de
th, 0
<
W
s
<
W and 1
≤
k
≤
N, may be of practical interest. Mathematically, the problem is given as
(9)
max
⁡
ℛ
^
min
⁡
𝒟
(10)
s
s
.
t
.
0
Q
de
≥
Q
de
th
(11)
0
s
0
<
W
s
<
W
,
(12)
00
1
≤
k
≤
N
.For a givenW
s and k, we take the first partial derivative of ℛ
^ with respect to Q
de and obtain
(13)
∂
ℛ
^
∂
Q
de
=
-
C
𝒫
(
H
0
)
W
-
W
s
W
d
Q
fa
d
Q
de
-
C
1
𝒫
(
H
1
)
W
-
W
s
W
=
-
C
𝒫
(
H
0
)
W
-
W
s
W
d
Q
fa
/
d
𝒫
de
d
Q
de
/
d
𝒫
de
-
C
1
𝒫
(
H
1
)
W
-
W
s
W
=
-
C
𝒫
(
H
0
)
W
-
W
s
W
×
N
(
N
-
1
k
-
1
)
𝒫
fa
k
-
1
(
1
-
𝒫
fa
)
N
-
k
N
(
N
-
1
k
-
1
)
𝒫
de
k
-
1
(
1
-
𝒫
de
)
N
-
k
d
𝒫
fa
d
𝒫
de
-
C
1
𝒫
(
H
1
)
W
-
W
s
W
=
-
C
𝒫
(
H
0
)
W
-
W
s
W
(
𝒫
fa
𝒫
de
)
k
-
1
(
1
-
𝒫
fa
1
-
𝒫
de
)
N
-
k
×
d
𝒫
fa
/
d
ϵ
d
𝒫
de
/
d
ϵ
-
C
1
𝒫
(
H
1
)
W
-
W
s
W
=
-
C
𝒫
(
H
0
)
(
1
+
γ
)
W
-
W
s
W
(
𝒫
fa
𝒫
de
)
k
-
1
×
(
1
-
𝒫
fa
1
-
𝒫
de
)
N
-
k
e
(
ϵ
γ
/
(
1
+
γ
)
)
-
(
ϵ
2
γ
(
γ
+
2
)
/
4
T
s
W
s
(
1
+
γ
)
2
)
-
C
1
𝒫
(
H
1
)
W
-
W
s
W
<
0
.
Then, we take the first partial derivative of 𝒟 with respect to Q
de and obtain
(14)
∂
𝒟
∂
Q
de
=
𝒫
(
H
0
)
d
Q
fa
d
Q
de
+
𝒫
(
H
1
)
=
𝒫
(
H
0
)
d
Q
fa
/
d
𝒫
de
d
Q
de
/
d
𝒫
de
+
𝒫
(
H
1
)
=
𝒫
(
H
0
)
N
(
N
-
1
k
-
1
)
𝒫
fa
k
-
1
(
1
-
𝒫
fa
)
N
-
k
N
(
N
-
1
k
-
1
)
𝒫
de
k
-
1
(
1
-
𝒫
de
)
N
-
k
×
d
𝒫
fa
d
𝒫
de
+
𝒫
(
H
1
)
=
𝒫
(
H
0
)
(
𝒫
fa
𝒫
de
)
k
-
1
×
(
1
-
𝒫
fa
1
-
𝒫
de
)
N
-
k
d
𝒫
fa
/
d
ϵ
d
𝒫
de
/
d
ϵ
+
𝒫
(
H
1
)
=
𝒫
(
H
0
)
(
1
+
γ
)
(
𝒫
fa
𝒫
de
)
k
-
1
(
1
-
𝒫
fa
1
-
𝒫
de
)
N
-
k
×
e
(
ϵ
γ
/
(
1
+
γ
)
)
-
(
ϵ
2
γ
(
γ
+
2
)
/
4
T
s
W
s
(
1
+
γ
)
2
)
+
𝒫
(
H
1
)
>
0
.Hence,ℛ
^ is a decreasing function of Q
de, and 𝒟 is an increasing function of Q
de. This proves that the throughput of the SUs ℛ
^ is maximized and the SU transmission delay 𝒟 is minimized only if the constraint (10) is at equality; that is, Q
de
=
Q
de
th. Therefore, the optimization problem can be reduced to
(15)
max
⁡
ℛ
^
min
⁡
𝒟
(16)
s
s
.
t
.
s
Q
de
=
Q
de
th
,
s
s
0
<
W
s
<
W
,
s
s
1
≤
k
≤
N
.In scenario 2, the CR network experiences interference from the PU; obviously,C
>
C
1. Also, it is assumed that the probability of presence of PU is small, say less than 0.3; hence, it is economically advisable to explore the secondary usage for the PU frequency band. Also, to sufficiently protect the PU, the target detection probability Q
de
th is set not less than 0.9. Therefore, the optimization problem can be approximated by maximizing ℛ while minimizing 𝒟 subject to (16). Furthermore, in the next section, we will prove that the maximum throughput and the minimum delay cannot be obtained simultaneously. Therefore, the objective of throughput-delay trade-off is to design the sensing parameters such that the throughput ℛ is maximized while the delay 𝒟 is constrained. The problem formulation can be stated as follows:
(17)
max
⁡
ℛ
s
s
.
t
.
s
Q
de
=
Q
de
th
,
ss
0
<
W
s
<
W
,
ss
1
≤
k
≤
N
,
ss
𝒟
≤
𝒟
th
,
where 𝒟
th is the threshold of the delay constraint.


## 3. Throughput-Delay Trade-Off: A Convex Optimization Perspective

In this section, we will investigate the throughput-delay trade-off problem from a convex optimization perspective. Letθ
=
(
1
+
γ
)
𝒬
-
1
(
𝒫
de
)
+
γ
2
T
s
W
s, and since
(18)
d
𝒫
fa
d
W
s
=
-
γ
2
T
s
π
W
s
e
-
θ
2
/
2
<
0
,
we have
(19)
∂
𝒟
∂
W
s
=
𝒫
(
H
0
)
N
(
N
-
1
k
-
1
)
×
(
𝒫
fa
)
k
-
1
(
1
-
𝒫
fa
)
N
-
k
d
𝒫
fa
d
W
s
<
0
.
Thus, 𝒟 is a decreasing function of W
s. Then,
(20)
∂
ℛ
∂
W
s
=
-
C
W
(
1
-
Q
fa
)
𝒫
(
H
0
)
-
W
-
W
s
W
C
𝒫
(
H
0
)
d
Q
fa
d
W
s
,
where
(21)
d
Q
fa
d
W
s
=
N
(
N
-
1
k
-
1
)
(
𝒫
fa
)
k
-
1
(
1
-
𝒫
fa
)
N
-
k
d
𝒫
fa
d
W
s
.
Obviously, lim
⁡
W
s
→
0
(
∂
ℛ
/
∂
W
s
)
=
∞, lim
⁡
W
s
→
W
(
∂
ℛ
/
∂
W
s
)
<
0. Thus, there must exist an optimal value of W
s that maximizes ℛ and the root of ∂
ℛ
/
∂
W
s
=
0 exists for W
s
∈
(
0
,
W
). Next, we will prove that the maximum point of ℛ is unique; namely, the root of ∂
ℛ
/
∂
W
s
=
0 is unique.Substituting (18) and (21) into (20), we have
(22)
∂
ℛ
∂
W
s
=
-
C
W
(
1
-
Q
fa
)
𝒫
(
H
0
)
+
C
𝒫
(
H
0
)
N
(
N
-
1
k
-
1
)
×
(
𝒫
fa
)
k
-
1
(
1
-
𝒫
fa
)
N
-
k
γ
2
W
-
W
s
W
T
s
π
W
s
e
-
θ
2
/
2
=
-
C
W
𝒫
(
H
0
)
[
∑
i
=
0
k
-
1
‍
(
N
i
)
(
𝒫
fa
)
i
(
1
-
𝒫
fa
)
N
-
i
00000000000000
-
N
(
N
-
1
k
-
1
)
(
𝒫
fa
)
k
-
1
(
1
-
𝒫
fa
)
N
-
k
00000000000000
×
(
W
-
W
s
)
γ
2
T
s
π
W
s
e
-
θ
2
/
2
]
.
Setting ∂
ℛ
/
∂
W
s
=
0, we have(23)
∑
i
=
0
k
-
1
‍
(
N
i
)
(
𝒫
fa
)
i
(
1
-
𝒫
fa
)
N
-
i
=
N
(
N
-
1
k
-
1
)
(
𝒫
fa
)
k
-
1
(
1
-
𝒫
fa
)
N
-
k
×
(
W
-
W
s
)
γ
2
T
s
π
W
s
e
-
θ
2
/
2
.
Then,
(24)
∑
i
=
0
k
-
1
(
N
i
)
(
𝒫
fa
)
i
(
1
-
𝒫
fa
)
N
-
i
N
(
N
-
1
k
-
1
)
(
𝒫
fa
)
k
-
1
(
1
-
𝒫
fa
)
N
-
k
(
W
-
W
s
)
(
γ
/
2
)
T
s
/
π
W
s
=
e
-
θ
2
/
2
,
(25)
ln
⁡
[
∑
i
=
0
k
-
1
(
N
i
)
(
𝒫
fa
)
i
-
k
+
1
(
1
-
𝒫
fa
)
k
-
i
N
(
N
-
1
k
-
1
)
(
W
-
W
s
)
(
γ
/
2
)
T
s
/
π
W
s
]
=
-
1
2
θ
2
.
According to (25), it can be derived that u
=
v, where
(26)
u
=
ln
⁡
⁡
[
2
(
k
-
1
)
!
(
N
-
k
)
!
γ
(
W
-
W
s
)
N
!
π
W
s
T
s
000000
×
∑
i
=
0
k
-
1
‍
(
N
i
)
(
𝒫
fa
)
i
-
k
+
1
(
1
-
𝒫
fa
)
k
-
i
]
,
v
=
-
1
2
θ
2
.Taking the first derivative ofu with respect to W
s, it is derived that
(27)
d
u
d
W
s
=
ϕ
1
+
ϕ
2
+
ϕ
3
,
where
(28)
ϕ
1
=
W
+
W
s
2
W
s
(
W
-
W
s
)
,
ϕ
2
=
-
d
𝒫
fa
d
W
s
∑
i
=
0
k
-
1
(
N
i
)
(
k
-
1
-
i
)
(
𝒫
fa
)
i
-
k
(
1
-
𝒫
fa
)
k
-
i
∑
i
=
0
k
-
1
(
N
i
)
(
𝒫
fa
)
i
-
k
+
1
(
1
-
𝒫
fa
)
k
-
i
,
ϕ
3
=
-
d
𝒫
fa
d
W
s
∑
i
=
0
k
-
1
(
N
i
)
(
k
-
i
)
(
𝒫
fa
)
i
-
k
+
1
(
1
-
𝒫
fa
)
k
-
i
-
1
∑
i
=
0
k
-
1
(
N
i
)
(
𝒫
fa
)
i
-
k
+
1
(
1
-
𝒫
fa
)
k
-
i
.
Since ϕ
1
>
0, ϕ
2
>
0, and ϕ
3
>
0, we have d
u
/
d
W
s
>
0, and u is an increasing function of W
s.Taking the first derivative ofv with respect to W
s, it is derived that
(29)
d
v
d
W
s
=
-
θ
d
θ
d
W
s
=
-
(
(
1
+
γ
)
𝒬
-
1
(
𝒫
de
)
+
γ
2
T
s
W
s
)
γ
T
s
2
W
s
.
Let ρ
=
(
(
1
+
γ
)
𝒬
-
1
(
𝒫
de
)
)
2
/
2
T
s
γ
2, for W
s
∈
(
0
,
ρ
], d
v
/
d
W
s
≥
0; for W
s
∈
(
ρ
,
W
), d
v
/
d
W
s
<
0. Thus, v is an increasing function of W
s for W
s
∈
(
0
,
ρ
] and a decreasing function of W
s for W
s
∈
(
ρ
,
W
). We have proved that d
u
/
d
W
s
>
d
v
/
d
W
s for W
s
∈
(
0
,
ρ
] in the Appendix.We know thatu and v must intersect each other since the root of ∂
ℛ
/
∂
W
s
=
0 exists for W
s
∈
(
0
,
W
). If u and v have an intersection for W
s
∈
(
0
,
ρ
], since u increases faster than v for W
s
∈
(
0
,
ρ
] and u
>
v for W
s
∈
(
ρ
,
W
), there is only one intersection between u and v, which is illustrated in Figure 2(a). If u and v do not have an intersection for W
s
∈
(
0
,
ρ
], they must have an intersection for W
s
∈
(
ρ
,
W
). Since u is an increasing function of W
s and v is a decreasing function of W
s for W
s
∈
(
ρ
,
W
), there is only one intersection between u and v, which is illustrated in Figure 2(b). Thus, the root of ∂
ℛ
/
∂
W
s
=
0 is unique.Illustration of the curves:u and v.
(a)
(b)From the above analysis, we can conclude thatℛ is a unimodal function for W
s
∈
(
0
,
W
). We define W
s
* as the root of ∂
ℛ
/
∂
W
s
=
0. Since 𝒟 is a decreasing function of W
s, there is no value of W
s that can maximize the throughput ℛ and minimize the delay 𝒟 simultaneously. We will optimize W
s and k jointly such that the throughput is maximized while the delay is constrained. To satisfy the delay QoS requirement, we set 𝒟
≤
𝒟
th, where 𝒟
th is the threshold of the delay constraint. Since 𝒟 is a decreasing function of W
s, we should choose W
s
≥
W
s
+, where W
s
+ is the minimum sensing bandwidth that can satisfy the delay QoS requirement and is determined by 𝒟
th.Different SUs have different QoS requirements. Let𝒟
* denote the transmission delay which is corresponding to W
s
*. For the SUs with relaxed delay QoS requirements, 𝒟
th may be larger than 𝒟
* and W
s
+
<
W
s
*. In this case, we should choose W
s
* to maximize the throughput ℛ, which is illustrated in Figure 3(a). For the SUs with stringent delay QoS requirements, 𝒟
th may be smaller than or equal to 𝒟
* and W
s
+
≥
W
s
*. In this case, we should choose W
s
+ to maximize the throughput ℛ, which is illustrated in Figure 3(b). For the optimal final decision threshold k
opt, no closed-form solution can be obtained. Hence, we will search through k from 1 to N to obtain k
opt. The optimal scheme that maximizes the throughput ℛ can be divided into 3 steps as follows.Illustration of the curves: normalized throughputℛ and normalized delay 𝒟.
(a)
(b)Step 1.
For eachk (k
=
1,2
,
…
,
N), calculate the root 𝒫
de
,
k of ∑
i
=
k
N
‍
(
N
i
)
(
𝒫
d
e
)
i
(
1
-
𝒫
de
)
N
-
i
=
Q
de
th, the root W
s
,
k
* of ∂
ℛ
/
∂
W
s
=
0, and the root 𝒫
fa
,
k of Q
fa
=
(
𝒟
th
-
𝒫
(
H
1
)
Q
de
th
)
/
𝒫
(
H
0
) by using the Bisection method [22].Step 2.
According to𝒫
de
,
k and 𝒫
fa
,
k, calculate W
s
,
k
+. If W
s
,
k
*
>
W
s
,
k
+, choose optimal sensing bandwidth W
s
,
k
opt
=
W
s
,
k
*; otherwise, choose W
s
,
k
opt
=
W
s
,
k
+.Step 3.
Calculate and compareℛ
k, and choose the maximum one.


## 4. Simulation Results

To evaluate the throughput-delay trade-off for various sensing schemes, simulation results have been conducted in this section. The frame duration isT
=
20 ms; the individual reporting duration is T
r
=
1 ms; the PU transmission bandwidth is W
=
2.5
×
1
0
4 Hz; the number of SUs is N
=
9; the SNR of the PU's signal at the receiver of SU is γ
=
-
10 dB unless otherwise stated; the SNR for the secondary link is γ
s
=
20 dB; 𝒫
(
H
0
)
=
0.8 unless otherwise stated.Figure4 illustrates the normalized throughput ℛ versus the threshold of the delay constraint for various counting rules. Optimal W
s is employed and Q
de
th
=
0.9. When 𝒟
th initially increases, the throughput increases. This means that relaxing the delay constraint will result in a higher throughput. However, when 𝒟
th is increased further, the throughput no longer increases and remains unchanged since the optimal sensing bandwidth is W
s
* in this case, and the throughput reaches the peak value. It is also seen that the optimal scheme can achieve a higher throughput than that using fixed thresholds. Majority rule is suboptimal and AND rule performs the worst. Thus, to enhance the throughput of the SUs, the final decision threshold k needs to be optimized.Figure 4
Normalized throughputℛ for various counting rules.In Figure5, the optimal k values are used for each sensing scheme. For the SUs with stringent delay QoS requirements, 𝒟
th
≤
𝒟
*, it can be observed that the throughput with optimal W
s is the same as that using W
s
+ as the sensing bandwidth. This is because the optimal W
s is equal to W
s
+ in this case, which has been discussed in Section 3. For the SUs with relaxed delay QoS requirements, 𝒟
th
>
𝒟
*, the throughput with optimal W
s reaches the peak value and remains unchanged. However, the throughput with W
s
=
W
s
+ decreases as the threshold of the delay constraint increases. This is because the optimal W
s is equal to W
s
* and W
s
+
<
W
s
* in this case, which has been discussed in Section 3. Larger Q
de
th means better protection to PU. It is seen that relaxing the constraint on the protection of PU will result in a higher throughput.Figure 5
Normalized throughputℛ for various sensing schemes.In Figures6 and 7, the sensing bandwidth W
s and the final decision threshold k are jointly optimized, Q
de
th
=
0.95. Figure 6 is simulated to show the normalized throughput ℛ versus the threshold of the delay constraint with different values of 𝒫
(
H
0
). It is also observed that when 𝒟
th initially increases, the throughput ℛ increases. However, when 𝒟
th is increased further (𝒟
th
>
𝒟
*), the throughput ℛ reaches the peak value and remains unchanged. The larger the value of 𝒫
(
H
0
), the higher the normalized throughput ℛ; this is because more spectrum opportunities can be reused by the SUs. In addition, 𝒟
* decreases as 𝒫
(
H
0
) becomes larger. In Figure 7, it is shown that the larger the value of γ, the higher the normalized throughput ℛ. In addition, 𝒟
* decreases as the SNR of the PU's signal at the receiver of SU increases.Figure 6
Normalized throughputℛ versus threshold of the delay constraint with different values of 𝒫
(
H
0
).Figure 7
Normalized throughputℛ versus threshold of the delay constraint with different values of γ.


## 5. Conclusion

This paper studies the new CSS frame structure and formulates the throughput-delay trade-off problem. Particularly, we optimize the sensing bandwidth and the final decision threshold jointly to maximize the throughput of the SUs under the constraint that the delay QoS requirements of the SUs are satisfied. And we have demonstrated the key role of convex optimization in solving the associated design problems. Simulation results have shown that different delay QoS requirements require different optimalW
s values, and the optimal scheme can effectively improve the throughput of the SUs.



---

*Source: 430696-2014-04-07.xml*