# A Hybrid Combination Scheme for Cooperative Spectrum Sensing in Cognitive Radio Networks

Authors: Changhua Yao; Qihui Wu
Journal: Mathematical Problems in Engineering
 (2014)

---

## Abstract

We propose a novel hybrid combination scheme in cooperative spectrum sensing (CSS), which utilizes the diversity of reporting channels to achieve better throughput performance. Secondary users (SUs) with good reporting channel quality transmit quantized local observation statistics to fusion center (FC), while others report their local decisions. FC makes the final decision by carrying out hybrid combination. We derive the closed-form expressions of throughput and detection performance as a function of the number of SUs which report local observation statistics. The simulation and numerical results show that the hybrid combination scheme can achieve better throughput performance than hard combination scheme and soft combination scheme.


---

## Body

## 1. Introduction

Cognitive radio (CR) is a promising technology to combat spectrum scarcity by exploiting the unused spectrum bands licensed to the primary user (PU) [1, 2]. There are many researches about spectrum sensing which plays a key role in cognitive radio systems and collaborative spectrum sensing schemes that have been proposed to improve the reliability of sensing [3–8], but it also introduces additional information exchange which leads to reporting overhead. In the centralized cooperative energy sensing, the hard combination scheme collects 1-bit local decision, while the soft combination scheme collects multibit information of the detected energy, which provides a better performance than the hard combination scheme at the cost of increased reporting overhead. The reporting overhead cannot be ignored when the local sensing data is reported to the FC through a common control channel (reporting channel), which is stringent bandwidth-limited for the efficient usage of limited spectrum resource [9, 10].There are some researches which investigate overhead-throughput tradeoff in cognitive radio network (CRN) that consists of a number of the SUs employing energy detectors and a single decision FC. Many methods have been proposed to reduce the reporting overhead. Some introduce multibit quantization combining scheme [11], to reduce the amount of transmitted data, and some focus on the selection of the collaborative users [12]. To our best knowledge, all the related researches adopt either hard combination scheme or soft combination scheme and assume that the data rates on the reporting channels between SU and FC are all the same. In fact, the attenuations of reporting channels are hardly the same [9]. To meet the bit error rate (BER) required by the reliable communication, the data rates on the reporting channels would be different. In hard combination scheme, SUs with high reporting data rate waste their reporting capability, and in soft combination scheme, SUs with low reporting data rate introduce large overhead.In this letter, we propose a novel hybrid combination scheme to achieve better throughput performance. SU transmits either local observation statistics or local decision to FC. FC makes the final decision by carrying out hybrid combination. The theoretical analysis and simulation show that the hybrid combination scheme outperforms hard combination and soft combination scheme.


## 2. System Model

We consider the scenario illustrated in Figure1. S
U
i (i
=
1,2
,
…
,
M where M denotes the number of SUs) is the independent energy detector and reports its local decision or its quantized local observation statistics to FC via common control channel (reporting channel) sequentially [9]. Though the bandwidth of reporting channel is determined by the resource allocation, the quality of reporting channels is different. For example, in Figure 1, S
U
i (i
=
K
+
1
,
K
+
2
,
…
,
M) are shadowed over the reporting channel. When the cooperative relationship between SUs and FC is set up, they should negotiate the data rate on the reporting channel according to the quality of reporting channel. We do not focus on the relationship among signal-to-noise ratio (SNR), modulation, BER, and data rate on the reporting link; just simply assume that the data rate is R
i when S
U
i transmits data on the reporting channel under the BER constraint to make the reporting reliable. We denote vector R
=
[
R
1
,
R
2
,
…
,
R
M
] as the descending order of reporting data rates. After the negotiation, reporting rate vector R can be obtained by the FC. In the hybrid combination scenario proposed, S
U
i (i
=
K
+
1
,
K
+
2
,
…
,
M) with bad reporting channel reports local decision to FC; S
U
i (i
=
1,2
,
…
,
K) with good reporting channel reports local observation statistics to FC. FC makes the final decision by carrying out hybrid combination.Figure 1
System model of hybrid combination scheme.The frame structure for the periodic spectrum sensing is shown in Figure2. All the SUs perform local spectrum sensing simultaneously in the sensing phase and report local data to the FC sequentially in the reporting phase. We assume that the duration of the sensing phase is τ
s, the duration of the reporting phase is τ
r, and the reporting delay of each S
U
i is τ
r
i. τ
r
i
_
s is the reporting delay of S
U
i if S
U
i reports local observation statistics, and τ
r
i
_
h is the reporting delay of S
U
i if S
U
i reports local decision.Figure 2
Frame structure of hybrid combination scheme.


## 3. Performance Analysis

### 3.1. Energy Detection

Local spectrum sensing problem using energy detection can be formulated as the following binary hypothesis test:(1)
H
1
:
y
i
(
n
)
=
h
i
(
n
)
s
i
(
n
)
+
u
i
(
n
)
,
H
0
:
y
i
(
n
)
=
u
i
(
n
)
,
where H
1 and H
0 denote that the PU on the channel is absent and present, respectively. y
i
(
n
) is the received signal at the nth sample in S
U
i. The noise u
i
(
n
) is a Gaussian, independent, and identically distributed random process with mean zero and variance σ
u
2. The primary signal s
i
(
n
) is a random process with mean zero and variance σ
s
2. We assume that the primary signal s
i
(
n
) and the noise u
i
(
n
) are both circularly symmetric complex Gaussian (CSCG) signal. h
i
(
n
) denotes the channel gain of the listening channel between the PU and S
U
i. Similar with the analysis in [7], We assume that h
i
(
n
)
=
h
i. We denote γ
i
=
|
h
i
|
2
σ
s
2
/
σ
u
2 as the signal-to-noise ratio (SNR) at the S
U
i when PU exists and assume that the size of the CRN is small compared with its distance from the primary system; all SUs experience almost identical path loss with same average SNR on the listening channel, therefore γ
1
=
γ
2
=
⋯
=
γ
i
=
⋯
=
γ
M
=
γ
=
γ
¯. According to the energy detection, we use the test statistic given by
(2)
Y
(
i
)
=
1
N
∑
n
=
1
N
|
y
i
(
n
)
|
2
,
where N denotes the number of samples. Using central limit theorem (CLT), for a large N, the probability density function (PDF) of Y
(
i
) under hypothesis H
0 can be approximated by a Gaussian distribution with mean u
0
=
σ
u
2 and variance σ
0
2
=
(
1
/
N
)
σ
u
4. The PDF of Y
(
i
) under hypothesis H
1 can be approximated by a Gaussian distribution with mean u
1
=
(
γ
+
1
)
σ
u
2 and variance σ
1
2
=
(
1
/
N
)
(
γ
+
1
)
2
σ
u
4. When the local detection threshold is given by λ
l, the probability of local false alarm is given by
(3)
P
f
_
l
=
Pr
[
Y
(
i
)
>
λ
l
∣
H
0
]
=
Q
(
λ
l
-
σ
u
2
σ
u
2
N
)
.The probability of local detection is given by(4)
P
d
_
l
=
Pr
[
Y
(
i
)
>
λ
l
∣
H
1
]
=
Q
(
λ
l
-
(
γ
+
1
)
σ
u
2
(
γ
+
1
)
σ
u
2
N
)
,
where
(5)
Q
(
x
)
=
1
2
π
∫
x
∞
exp
⁡
(
-
t
2
2
)
d
t
.


### 3.2. Hybrid Combination

In the hybrid combination system model,S
U
i (i
=
K
+
1
,
K
+
2
,
…
,
M) reports its local decision to FC. We define P
d
f
c
¯ as the target probability of system detection with which the PUs are regarded as being sufficiently protected. When all the SUs report local decision to FC, according to the OR-rule in hard combination (To focus on the overhead-throughput tradeoff problem, we use OR-rule for analysis simplification. The task of investigating other combination rules, e.g., the majority rule, is important but challenging, which would be studied in our future work.), the probability of system detection P
d
f
c
¯ is given by
(6)
P
d
f
c
¯
=
1
-
(
1
-
P
d
_
l
)
M
.Then the probability of local detectionP
d
_
l is given by
(7)
P
d
_
l
=
1
-
(
1
-
P
d
f
c
¯
)
1
/
M
.By substituting (7) into (4), the local detection threshold λ
l is given by
(8)
λ
l
=
(
γ
+
1
)
σ
u
2
(
Q
-
1
(
1
-
(
1
-
P
d
f
c
¯
)
1
/
M
)
N
+
1
)
.ForS
U
i (i
=
1,2
,
…
,
K), following the analysis of soft cooperative energy detection in [8, 13], we use the test statistic given by
(9)
T
S
-
K
=
1
K
N
∑
i
=
1
K
∑
n
=
1
N
|
y
i
(
n
)
|
2
.For largeK
N, according to CLT, the PDF of T
S
-
K under hypothesis H
0 can be approximated as Gaussian with mean σ
u
2 and variance (
1
/
K
N
)
σ
u
4. The PDF of T
S
-
K under hypothesis H
1 can be approximated by a Gaussian distribution with mean (
γ
+
1
)
σ
u
2 and variance (
1
/
K
N
)
(
γ
+
1
)
2
σ
u
4. The probability of detection with K nodes soft combination P
d
_
K is given by
(10)
P
d
_
K
=
Pr
[
Y
(
i
)
>
λ
K
∣
H
1
]
=
Q
(
λ
K
-
(
γ
+
1
)
σ
u
2
(
γ
+
1
)
σ
u
2
K
N
)
,
where λ
K is the soft combination detection threshold. According to the OR-rule, the relationship between P
d
f
c
¯ and P
d
_
K is given by
(11)
P
d
f
c
¯
=
1
-
(
1
-
P
d
_
l
)
M
-
K
(
1
-
P
d
_
K
)
.Then we can getP
d
_
K by solving (11)
(12)
P
d
_
K
=
1
-
(
1
-
P
d
f
c
¯
)
(
1
-
P
d
_
l
)
M
-
K
.According to (10), λ
K is given by
(13)
λ
K
=
(
γ
+
1
)
σ
u
2
(
Q
-
1
(
P
d
_
K
)
K
N
+
1
)
.By (3), the probability of false alarm of K soft combination is given by
(14)
P
f
_
K
=
Pr
[
Y
(
i
)
>
λ
K
∣
H
0
]
=
Q
(
λ
K
-
σ
u
2
σ
u
2
K
N
)
.
According to OR-rule and (14), the probability of system false alarm P
f
f
c when K SUs report local observation statistics is given by
(15)
P
f
f
c
=
1
-
(
1
-
P
f
_
l
)
M
-
K
(
1
-
P
f
_
K
)
=
1
-
(
1
-
P
f
_
l
)
M
-
K
×
(
(
γ
+
1
)
σ
u
2
(
Q
-
1
(
P
d
_
K
)
/
K
N
+
1
)
-
σ
u
2
σ
u
2
1
-
Q
d
d
d
d
×
(
(
γ
+
1
)
σ
u
2
(
Q
-
1
(
P
d
_
K
)
/
K
N
+
1
)
-
σ
u
2
σ
u
2
K
N
)
)
,
where P
d
_
K, P
f
_
l, and P
d
_
l are related to P
d
f
c
¯, given by (12), (3), and (4), respectively.


### 3.3. The Throughput

We assume that the PU is either absent or present during each frame duration (Figure2). The achievable throughput of the secondary network is given by
(16)
C
=
T
-
τ
s
-
τ
r
T
(
1
-
P
f
f
c
)
C
0
Pr
(
H
0
)
,
where Pr
(
H
0
) is the probability for which the PU is inactive. C
0 is the throughput of the secondary network when it operates in the absence of PU.We assume that the local observation statistics are quantized withD bits, which would be a sufficient number of bits to neglect the quantization noise [11]. If S
U
i reports its local observation statistics to FC, the reporting delay would be τ
r
i
_
s
=
D
/
R
i. If S
U
i reports its local decision to FC, the reporting delay would be τ
r
i
_
h
=
1
/
R
i. When S
U
i (i
=
1,2
,
…
,
K) reports its local observation statistics to FC and S
U
i (i
=
K
+
1
,
K
+
2
,
…
,
M) reports its local decision to FC, according to the frame structure in Figure 2, the total reporting delay is
(17)
τ
r
=
∑
i
=
1
K
τ
r
i
-
s
+
∑
i
=
K
+
1
M
τ
r
i
-
h
=
∑
i
=
1
K
D
R
i
+
∑
i
=
K
+
1
M
1
R
i
.The throughput is given by(18)
C
=
T
-
τ
s
-
∑
i
=
1
K
(
D
/
R
i
)
+
∑
i
=
K
+
1
M
(
1
/
R
i
)
T
×
(
1
-
P
f
f
c
)
C
0
Pr
(
H
0
)
.Intuitively, there is a tradeoff betweenP
f
f
c and τ
r. When K increases, the P
f
f
c decreases (Figure 3), which means the secondary network can access the channel with a higher chance, but the reporting delay also increases at the same time. The relationship between K and the throughput C is obtained by substituting (15) into (18)
(19)
C
=
T
-
τ
s
-
∑
i
=
1
K
(
D
/
R
i
)
+
∑
i
=
K
+
1
M
(
1
/
R
i
)
T
(
1
-
P
f
_
l
)
M
-
K
×
C
0
Pr
(
H
0
)
×
(
(
γ
+
1
)
σ
u
2
(
Q
-
1
(
P
d
_
K
)
/
K
N
+
1
)
-
σ
u
2
σ
u
2
1
-
Q
f
d
f
f
f
×
(

(
γ
+
1
)
σ
u
2
(
Q
-
1
(
P
d
_
K
)
/
K
N
+
1
)
-
σ
u
2
σ
u
2

K
N
)
)
,
where P
d
_
K, P
f
_
l, and P
d
_
l are related to P
d
f
c
¯, given by (12), (3), and (4), respectively, and P
d
f
c
¯ is determined by the protection demand of PU system.Figure 3
The probability of detection versus probability of false alarm with differentK when SNR
=
-
22 dB.


## 3.1. Energy Detection

Local spectrum sensing problem using energy detection can be formulated as the following binary hypothesis test:(1)
H
1
:
y
i
(
n
)
=
h
i
(
n
)
s
i
(
n
)
+
u
i
(
n
)
,
H
0
:
y
i
(
n
)
=
u
i
(
n
)
,
where H
1 and H
0 denote that the PU on the channel is absent and present, respectively. y
i
(
n
) is the received signal at the nth sample in S
U
i. The noise u
i
(
n
) is a Gaussian, independent, and identically distributed random process with mean zero and variance σ
u
2. The primary signal s
i
(
n
) is a random process with mean zero and variance σ
s
2. We assume that the primary signal s
i
(
n
) and the noise u
i
(
n
) are both circularly symmetric complex Gaussian (CSCG) signal. h
i
(
n
) denotes the channel gain of the listening channel between the PU and S
U
i. Similar with the analysis in [7], We assume that h
i
(
n
)
=
h
i. We denote γ
i
=
|
h
i
|
2
σ
s
2
/
σ
u
2 as the signal-to-noise ratio (SNR) at the S
U
i when PU exists and assume that the size of the CRN is small compared with its distance from the primary system; all SUs experience almost identical path loss with same average SNR on the listening channel, therefore γ
1
=
γ
2
=
⋯
=
γ
i
=
⋯
=
γ
M
=
γ
=
γ
¯. According to the energy detection, we use the test statistic given by
(2)
Y
(
i
)
=
1
N
∑
n
=
1
N
|
y
i
(
n
)
|
2
,
where N denotes the number of samples. Using central limit theorem (CLT), for a large N, the probability density function (PDF) of Y
(
i
) under hypothesis H
0 can be approximated by a Gaussian distribution with mean u
0
=
σ
u
2 and variance σ
0
2
=
(
1
/
N
)
σ
u
4. The PDF of Y
(
i
) under hypothesis H
1 can be approximated by a Gaussian distribution with mean u
1
=
(
γ
+
1
)
σ
u
2 and variance σ
1
2
=
(
1
/
N
)
(
γ
+
1
)
2
σ
u
4. When the local detection threshold is given by λ
l, the probability of local false alarm is given by
(3)
P
f
_
l
=
Pr
[
Y
(
i
)
>
λ
l
∣
H
0
]
=
Q
(
λ
l
-
σ
u
2
σ
u
2
N
)
.The probability of local detection is given by(4)
P
d
_
l
=
Pr
[
Y
(
i
)
>
λ
l
∣
H
1
]
=
Q
(
λ
l
-
(
γ
+
1
)
σ
u
2
(
γ
+
1
)
σ
u
2
N
)
,
where
(5)
Q
(
x
)
=
1
2
π
∫
x
∞
exp
⁡
(
-
t
2
2
)
d
t
.


## 3.2. Hybrid Combination

In the hybrid combination system model,S
U
i (i
=
K
+
1
,
K
+
2
,
…
,
M) reports its local decision to FC. We define P
d
f
c
¯ as the target probability of system detection with which the PUs are regarded as being sufficiently protected. When all the SUs report local decision to FC, according to the OR-rule in hard combination (To focus on the overhead-throughput tradeoff problem, we use OR-rule for analysis simplification. The task of investigating other combination rules, e.g., the majority rule, is important but challenging, which would be studied in our future work.), the probability of system detection P
d
f
c
¯ is given by
(6)
P
d
f
c
¯
=
1
-
(
1
-
P
d
_
l
)
M
.Then the probability of local detectionP
d
_
l is given by
(7)
P
d
_
l
=
1
-
(
1
-
P
d
f
c
¯
)
1
/
M
.By substituting (7) into (4), the local detection threshold λ
l is given by
(8)
λ
l
=
(
γ
+
1
)
σ
u
2
(
Q
-
1
(
1
-
(
1
-
P
d
f
c
¯
)
1
/
M
)
N
+
1
)
.ForS
U
i (i
=
1,2
,
…
,
K), following the analysis of soft cooperative energy detection in [8, 13], we use the test statistic given by
(9)
T
S
-
K
=
1
K
N
∑
i
=
1
K
∑
n
=
1
N
|
y
i
(
n
)
|
2
.For largeK
N, according to CLT, the PDF of T
S
-
K under hypothesis H
0 can be approximated as Gaussian with mean σ
u
2 and variance (
1
/
K
N
)
σ
u
4. The PDF of T
S
-
K under hypothesis H
1 can be approximated by a Gaussian distribution with mean (
γ
+
1
)
σ
u
2 and variance (
1
/
K
N
)
(
γ
+
1
)
2
σ
u
4. The probability of detection with K nodes soft combination P
d
_
K is given by
(10)
P
d
_
K
=
Pr
[
Y
(
i
)
>
λ
K
∣
H
1
]
=
Q
(
λ
K
-
(
γ
+
1
)
σ
u
2
(
γ
+
1
)
σ
u
2
K
N
)
,
where λ
K is the soft combination detection threshold. According to the OR-rule, the relationship between P
d
f
c
¯ and P
d
_
K is given by
(11)
P
d
f
c
¯
=
1
-
(
1
-
P
d
_
l
)
M
-
K
(
1
-
P
d
_
K
)
.Then we can getP
d
_
K by solving (11)
(12)
P
d
_
K
=
1
-
(
1
-
P
d
f
c
¯
)
(
1
-
P
d
_
l
)
M
-
K
.According to (10), λ
K is given by
(13)
λ
K
=
(
γ
+
1
)
σ
u
2
(
Q
-
1
(
P
d
_
K
)
K
N
+
1
)
.By (3), the probability of false alarm of K soft combination is given by
(14)
P
f
_
K
=
Pr
[
Y
(
i
)
>
λ
K
∣
H
0
]
=
Q
(
λ
K
-
σ
u
2
σ
u
2
K
N
)
.
According to OR-rule and (14), the probability of system false alarm P
f
f
c when K SUs report local observation statistics is given by
(15)
P
f
f
c
=
1
-
(
1
-
P
f
_
l
)
M
-
K
(
1
-
P
f
_
K
)
=
1
-
(
1
-
P
f
_
l
)
M
-
K
×
(
(
γ
+
1
)
σ
u
2
(
Q
-
1
(
P
d
_
K
)
/
K
N
+
1
)
-
σ
u
2
σ
u
2
1
-
Q
d
d
d
d
×
(
(
γ
+
1
)
σ
u
2
(
Q
-
1
(
P
d
_
K
)
/
K
N
+
1
)
-
σ
u
2
σ
u
2
K
N
)
)
,
where P
d
_
K, P
f
_
l, and P
d
_
l are related to P
d
f
c
¯, given by (12), (3), and (4), respectively.


## 3.3. The Throughput

We assume that the PU is either absent or present during each frame duration (Figure2). The achievable throughput of the secondary network is given by
(16)
C
=
T
-
τ
s
-
τ
r
T
(
1
-
P
f
f
c
)
C
0
Pr
(
H
0
)
,
where Pr
(
H
0
) is the probability for which the PU is inactive. C
0 is the throughput of the secondary network when it operates in the absence of PU.We assume that the local observation statistics are quantized withD bits, which would be a sufficient number of bits to neglect the quantization noise [11]. If S
U
i reports its local observation statistics to FC, the reporting delay would be τ
r
i
_
s
=
D
/
R
i. If S
U
i reports its local decision to FC, the reporting delay would be τ
r
i
_
h
=
1
/
R
i. When S
U
i (i
=
1,2
,
…
,
K) reports its local observation statistics to FC and S
U
i (i
=
K
+
1
,
K
+
2
,
…
,
M) reports its local decision to FC, according to the frame structure in Figure 2, the total reporting delay is
(17)
τ
r
=
∑
i
=
1
K
τ
r
i
-
s
+
∑
i
=
K
+
1
M
τ
r
i
-
h
=
∑
i
=
1
K
D
R
i
+
∑
i
=
K
+
1
M
1
R
i
.The throughput is given by(18)
C
=
T
-
τ
s
-
∑
i
=
1
K
(
D
/
R
i
)
+
∑
i
=
K
+
1
M
(
1
/
R
i
)
T
×
(
1
-
P
f
f
c
)
C
0
Pr
(
H
0
)
.Intuitively, there is a tradeoff betweenP
f
f
c and τ
r. When K increases, the P
f
f
c decreases (Figure 3), which means the secondary network can access the channel with a higher chance, but the reporting delay also increases at the same time. The relationship between K and the throughput C is obtained by substituting (15) into (18)
(19)
C
=
T
-
τ
s
-
∑
i
=
1
K
(
D
/
R
i
)
+
∑
i
=
K
+
1
M
(
1
/
R
i
)
T
(
1
-
P
f
_
l
)
M
-
K
×
C
0
Pr
(
H
0
)
×
(
(
γ
+
1
)
σ
u
2
(
Q
-
1
(
P
d
_
K
)
/
K
N
+
1
)
-
σ
u
2
σ
u
2
1
-
Q
f
d
f
f
f
×
(

(
γ
+
1
)
σ
u
2
(
Q
-
1
(
P
d
_
K
)
/
K
N
+
1
)
-
σ
u
2
σ
u
2

K
N
)
)
,
where P
d
_
K, P
f
_
l, and P
d
_
l are related to P
d
f
c
¯, given by (12), (3), and (4), respectively, and P
d
f
c
¯ is determined by the protection demand of PU system.Figure 3
The probability of detection versus probability of false alarm with differentK when SNR
=
-
22 dB.


## 4. Numerical Results and Discussions

### 4.1. Numerical Results

The system is set up as follows: the number of SUs in the CRN is set to beM
=
18, and the fixed frame duration T
=
20 ms. The sampling frequency is 6 MHz and the τ
s is 1 ms. We set quantization bits of observation statistics D
=
8 in order to ensure that the quantization can well preserve the local observation statistics. D is bigger than that used in [11], because there is still some quantization noise in [11] which decreases with D; we do not focus on the analysis of quantization, so we use the sufficient quantization bits to ensure (11) is achievable.Figure3 shows the detection performance of the proposed hybrid detector (the probability of detection versus probability of false alarm). The result verifies the detection performance of the proposed hybrid detector. The hybrid detector works as the single detector at any K values: the probability of detection increases as the probability of false alarm grows.In addition, the performance grows better whenK grows. This result is reasonable because the more SUs report their local observation statistics, the more information FC gets.Figure4 shows the detection performance of the hybrid combination scheme. The detection performance grows better when the SNR increases, and the probability of false alarm increases when the probability of system detection P
d
f
c
¯ increases (we choose the probability of system detection P
d
f
c
¯ 0.9, 0.95, 0.99 as typical values). When all the SUs report local observation statistics (K
=
M, soft combination), the detection performance is best. When all the SUs report local observation statistics (K
=
0, hard combination), the detection performance is worst. The result means that the hybrid combination method is reasonable (P
f
f
c decreases when K increases). In other words, in the hybrid combination scheme, when the number of the SUs reporting their local observation statistics to FC increases, the accuracy of sensing result will be enhanced.Figure 4
The false alarm probability versus the number of SUsK which report local observation statistics in different settings.The results in Figures3 and 4 verify the proposed hybrid detector’s reasonability, and the advantage of the proposed scheme over present scheme is the throughput when the reporting overhead is considered (Figures 5 and 6).Figure 5
The throughput versus the number of SUsK which report local observation statistics in different settings, (P
d
f
c
¯ is 0.99, γ is −18 dB).Figure 6
Performance comparison between the proposed hybrid combination scheme and the exiting scheme with different reporting rate vectors.Figure5 shows the throughput when using the reporting rate vector (RRV) values shown in Table 1, which is similar with the simulation setting in [11]. The throughput first increases as K grows, resulting from the decrease of the probability of system false alarm. Then the throughput decreases because the overhead increases fast when SUs with bad reporting channel report their observation statistics to FC rather than local decisions. We can find the best K
(
K
*
) to obtain the best performance in the proposed hybrid combination scheme, which would outperform both hard combination and soft combination.Table 1
No.
Reporting rate vector (RRV) (kbit/s)
1
[30, 30, 30, 30, 30, 30, 20, 20, 20, 20, 20, 20, 15, 15, 15, 15, 15, 15]
2
[100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 10, 10, 10, 10, 10, 10, 10, 10]
3
[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]Figure6 shows the performance comparison between the proposed hybrid combination scheme and the exiting combination scheme, that is, hard combination scheme, adopted by [12] and soft combination scheme, adopted by [5], also in [7, 13]. The reporting rate vector (RRV) values are shown in Table 2; we denote σ as the standard deviation of RRV. The value of σ shows the diversity of reporting channel quality.Table 2
No.
Reporting rate vector (RRV) (kbit/s)
1
[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]; σ
=
0
2
[30, 30, 30, 30, 30, 30, 20, 20, 20, 20, 20, 20, 16, 16, 16, 16, 16, 16]; σ
=
6.0585
3
[40, 40, 40, 40, 40, 40, 40, 40, 40, 12, 12, 12, 12, 12, 12, 12, 12, 12]; σ
=
14.4059
4
[50, 50, 50, 50, 40, 40, 40, 40, 40, 13, 13, 13, 13, 13, 13, 13, 13, 13]; σ
=
18.9185
5
[70, 70, 70, 70, 70, 70, 70, 70, 70, 12, 12, 12, 12, 12, 12, 12, 12, 12]; σ
=
29.6560
6
[90, 90, 90, 90, 90, 90, 90, 90, 90, 10, 10, 10, 10, 10, 10, 10, 10, 10]; σ
=
40.9048
7
[100, 100, 100, 100, 100, 100, 100, 100, 100, 9, 9, 9, 9, 9, 9, 9, 9, 9]; σ
=
46.5292With different RRVs, the result of comparison between soft and hard combination scheme varies, which means the diversity of reporting channel quality has great influence on the choice of combination scheme.However, the result shows that the proposed hybrid combination scheme outperforms both hard combination scheme [12] and soft combination scheme [5] in different environments, especially when the diversity of channel quality is obvious (σ increases). There is also throughput improvement when the data rates are the same (σ is zero). The explanation for the better performance is that we consider the diversity of reporting channel which has not been taken into consideration in present works.


### 4.2. Implementation and Complexity Analysis

According toR obtained by the negotiation when the cooperative relationship between SUs and FC is setting up, FC can find the K
* according to (19). The computing complexity is low because FC only needs to compute M (number of SUs) values of (19), and M would not be large in the practical cooperative system. Then the FC obtains a reporting model vector (RMV) composed of M bits; the ith bit of the RMV (RM
V
i) denotes the reporting model of S
U
i. RM
V
i
=
0 means S
U
i reports its local decision, and RM
V
i
=
1 means S
U
i reports its observation statistics. Just like the cooperative system in [12], at the beginning of each frame, the FC would broadcast a beacon message during beacon period (BP) which contains the start time and length of the quiet period (QP) for channel sensing, and the RMV would be attached to the beacon message. In this way, the overhead of the hybrid combination is only M bits attached to the broadcasted beacon message. In all, the computing complexity and the additional overhead of the hybrid combination are very slight.


## 4.1. Numerical Results

The system is set up as follows: the number of SUs in the CRN is set to beM
=
18, and the fixed frame duration T
=
20 ms. The sampling frequency is 6 MHz and the τ
s is 1 ms. We set quantization bits of observation statistics D
=
8 in order to ensure that the quantization can well preserve the local observation statistics. D is bigger than that used in [11], because there is still some quantization noise in [11] which decreases with D; we do not focus on the analysis of quantization, so we use the sufficient quantization bits to ensure (11) is achievable.Figure3 shows the detection performance of the proposed hybrid detector (the probability of detection versus probability of false alarm). The result verifies the detection performance of the proposed hybrid detector. The hybrid detector works as the single detector at any K values: the probability of detection increases as the probability of false alarm grows.In addition, the performance grows better whenK grows. This result is reasonable because the more SUs report their local observation statistics, the more information FC gets.Figure4 shows the detection performance of the hybrid combination scheme. The detection performance grows better when the SNR increases, and the probability of false alarm increases when the probability of system detection P
d
f
c
¯ increases (we choose the probability of system detection P
d
f
c
¯ 0.9, 0.95, 0.99 as typical values). When all the SUs report local observation statistics (K
=
M, soft combination), the detection performance is best. When all the SUs report local observation statistics (K
=
0, hard combination), the detection performance is worst. The result means that the hybrid combination method is reasonable (P
f
f
c decreases when K increases). In other words, in the hybrid combination scheme, when the number of the SUs reporting their local observation statistics to FC increases, the accuracy of sensing result will be enhanced.Figure 4
The false alarm probability versus the number of SUsK which report local observation statistics in different settings.The results in Figures3 and 4 verify the proposed hybrid detector’s reasonability, and the advantage of the proposed scheme over present scheme is the throughput when the reporting overhead is considered (Figures 5 and 6).Figure 5
The throughput versus the number of SUsK which report local observation statistics in different settings, (P
d
f
c
¯ is 0.99, γ is −18 dB).Figure 6
Performance comparison between the proposed hybrid combination scheme and the exiting scheme with different reporting rate vectors.Figure5 shows the throughput when using the reporting rate vector (RRV) values shown in Table 1, which is similar with the simulation setting in [11]. The throughput first increases as K grows, resulting from the decrease of the probability of system false alarm. Then the throughput decreases because the overhead increases fast when SUs with bad reporting channel report their observation statistics to FC rather than local decisions. We can find the best K
(
K
*
) to obtain the best performance in the proposed hybrid combination scheme, which would outperform both hard combination and soft combination.Table 1
No.
Reporting rate vector (RRV) (kbit/s)
1
[30, 30, 30, 30, 30, 30, 20, 20, 20, 20, 20, 20, 15, 15, 15, 15, 15, 15]
2
[100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 10, 10, 10, 10, 10, 10, 10, 10]
3
[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]Figure6 shows the performance comparison between the proposed hybrid combination scheme and the exiting combination scheme, that is, hard combination scheme, adopted by [12] and soft combination scheme, adopted by [5], also in [7, 13]. The reporting rate vector (RRV) values are shown in Table 2; we denote σ as the standard deviation of RRV. The value of σ shows the diversity of reporting channel quality.Table 2
No.
Reporting rate vector (RRV) (kbit/s)
1
[20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20]; σ
=
0
2
[30, 30, 30, 30, 30, 30, 20, 20, 20, 20, 20, 20, 16, 16, 16, 16, 16, 16]; σ
=
6.0585
3
[40, 40, 40, 40, 40, 40, 40, 40, 40, 12, 12, 12, 12, 12, 12, 12, 12, 12]; σ
=
14.4059
4
[50, 50, 50, 50, 40, 40, 40, 40, 40, 13, 13, 13, 13, 13, 13, 13, 13, 13]; σ
=
18.9185
5
[70, 70, 70, 70, 70, 70, 70, 70, 70, 12, 12, 12, 12, 12, 12, 12, 12, 12]; σ
=
29.6560
6
[90, 90, 90, 90, 90, 90, 90, 90, 90, 10, 10, 10, 10, 10, 10, 10, 10, 10]; σ
=
40.9048
7
[100, 100, 100, 100, 100, 100, 100, 100, 100, 9, 9, 9, 9, 9, 9, 9, 9, 9]; σ
=
46.5292With different RRVs, the result of comparison between soft and hard combination scheme varies, which means the diversity of reporting channel quality has great influence on the choice of combination scheme.However, the result shows that the proposed hybrid combination scheme outperforms both hard combination scheme [12] and soft combination scheme [5] in different environments, especially when the diversity of channel quality is obvious (σ increases). There is also throughput improvement when the data rates are the same (σ is zero). The explanation for the better performance is that we consider the diversity of reporting channel which has not been taken into consideration in present works.


## 4.2. Implementation and Complexity Analysis

According toR obtained by the negotiation when the cooperative relationship between SUs and FC is setting up, FC can find the K
* according to (19). The computing complexity is low because FC only needs to compute M (number of SUs) values of (19), and M would not be large in the practical cooperative system. Then the FC obtains a reporting model vector (RMV) composed of M bits; the ith bit of the RMV (RM
V
i) denotes the reporting model of S
U
i. RM
V
i
=
0 means S
U
i reports its local decision, and RM
V
i
=
1 means S
U
i reports its observation statistics. Just like the cooperative system in [12], at the beginning of each frame, the FC would broadcast a beacon message during beacon period (BP) which contains the start time and length of the quiet period (QP) for channel sensing, and the RMV would be attached to the beacon message. In this way, the overhead of the hybrid combination is only M bits attached to the broadcasted beacon message. In all, the computing complexity and the additional overhead of the hybrid combination are very slight.


## 5. Conclusions

In this paper, we investigated overhead-throughput tradeoff over different reporting channel quality in CRN that consists of a number of the SUs employing energy detectors and a single decision fusion center. We proposed a novel hybrid combination scheme with low overhead and complexity, which outperforms both hard combination and soft combination scheme, especially when the diversity of the reporting channel is obvious.



---

*Source: 106106-2014-03-06.xml*