+
=
1
0
H n s h
H n
r
k k
k
k
i
m
k
i
k
i
r >
=1
2
The distribution of the signal at the output of the energy detector
in H0 and H1 Scenarios is centralized and non-centralized Chi-
square respectively.
( ), , m Q P
i i m
i
d
2 =
|
|
.
|
\
|
= m , P
i i
f
2
1
I
February 17, 2011 Ebkarami@sce.carleton.ca
Sensing Fusion
( ), P P
N
n
n
d
OR
d [
=
=
1
1 1
( ), P P
N
n
n
f
OR
f [
=
=
1
1 1
, P P
N
n
n
d
AND
d [
=
=
1
. P P
N
n
n
f
AND
f [
=
=
1
Conventional sensing fusion methods are the And-rule,
the Or-rule and the min M out of N rule.
February 17, 2011 Ebkarami@sce.carleton.ca
Previous Work on CR
Spectrum sharing using coalition games
Dynamic distributed coalition formation protocol for spectrum sharing.
Analysis of the proposed protocol in terms of throughput, mean and
variance of the required time to reach the grand coalition.
Outputs:
One conference paper accepted for presentation in ICC2011.
One journal paper submitted to IEEE Journal on Selected Areas in
Communications, special issue on advances in military networking
and communications.
February 17, 2011 Ebkarami@sce.carleton.ca
Current Work on CR
Optimization of the cooperative spectrum sensing
1. Cooperation between SUs improves the precision of the
sensing but it requires some extra bandwidth for negotiations
between members of the cluster. We resolve this problem with
cluster size optimization.
2. Decisions received from the other members of the cluster is
noisy and sometimes not trustable. A new optimized fusion
method is proposed to resolve this problem.
3. Sensing fusion is performed as centralized. A new adaptive
distributed cooperative spectrum sensing is proposed to
resolve this problem.
February 17, 2011 Ebkarami@sce.carleton.ca
Throughput versus Cluster Size
Assume each SU spends m of each Ts symbols for
spectrum sensing. The effective throughput of each SU
is
( ) | |
i N
tot
d
tot
f
s
i
C ,..., , N , P P
T
N m
R
1
1 1
|
|
.
|
\
|
+
=
( ) ( ) | | , N , P P
T
N m
, N , P R
tot
d
tot
f
s
tot
d
|
|
.
|
\
|
+
~ 1 1
( ) | | , N , P P
T
N m
max Arg N
tot
d
tot
f
s
N opt
|
|
.
|
\
|
+
= 1 1
February 17, 2011 Ebkarami@sce.carleton.ca
Numerical Results
2 4 6 8 10 12 14 16 18 20
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
Cooperation cluster size
N
o
r
m
a
l
i
z
e
d
t
h
r
o
u
g
h
p
u
t
AND rule
OR rule
SNR=-5dB
SNR=0dB
SNR=5dB
Normalized achievable throughput for
m=0.05Ts
February 17, 2011 Ebkarami@sce.carleton.ca
Numerical Results
Normalized achievable throughput for
m=0.2Ts
2 4 6 8 10 12 14 16 18 20
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
Cooperation cluster size
N
o
r
m
a
l
i
z
e
d
t
h
r
o
u
g
h
p
u
t
AND rule
OR rule
SNR=5dB
SNR=0dB
SNR=-5dB
February 17, 2011 Ebkarami@sce.carleton.ca
Any comment?