Академический Документы
Профессиональный Документы
Культура Документы
+
=
1
0
) ( ) (
) (
) (
H t n t hs
H t n
t r
where n(t) AWGN (Additive White Gaussian Noise)
s(t) Transmitted signal of the primary user
h Amplitude gain of the channel
H0 Null hypothesis No licensed user signal in a certain spectrum
band.
H1 Alternative hypothesis There exists some licensed user signal.
Fully Distributed Cooperative Spectrum Sensing for Cognitive Radio Ad Hoc Networks
Spectrum Sensing Techniques
Most common transmitter detection tech
niques are:
Energy Detection
Matched Filter detection
Cyclostationary Feature Detection
Only energy detection is considered as local spectrum
sensing technique for implementation for the sake of
simplicity.
Fully Distributed Cooperative Spectrum Sensing for Cognitive Radio Ad Hoc Networks
Network of CRUs
Fully Distributed Cooperative Spectrum Sensing for Cognitive Radio Ad Hoc Networks
7
1
8
10
6
4
3
2
9
5
Node
Bidirectional links
Consensus based scheme
This scheme is based on recent advances in consensus algorithms
that have taken inspiration from self-organizing behavior of
animal groups such as birds, fish, ants, honey bees and others.
A CRU needs only to set up local interactions without a centralize
d node in cognitive radio ad hoc networks.
Limitation of existing technique is that choice of step size depen
ds on maximum number of neighbors of a node in network.
Fully Distributed Cooperative Spectrum Sensing for Cognitive Radio Ad Hoc Networks
Assumptions in proposed scheme
The following are two assumptions for the pro
posed scheme.
There is full duplex wireless connection between
CRU and each of its desired neighbor and remains
connected until the energy converges
Network topology is modeled as fixed graph.
Fully Distributed Cooperative Spectrum Sensing for Cognitive Radio Ad Hoc Networks
The gradient-based algorithm for this purpose can be stated as:
where x
m
(i) is the energy received neighbors. The converged value
is then compared with the predetermined threshold . Each CRU
gets the final decision locally as
(
= +
m
m
m n
n n
i x
i x i x
i x i x
) (
) ( ) (
) ( ) 1 (
>
=
. , 0
, , 1
*
otherwise
x if
Decision
Fully Distributed Cooperative Spectrum Sensing for Cognitive Radio Ad Hoc Networks
Algorithm
1: Initially CRUn do
2: calculate En
3: xn(0)=En
4: emit xn(0) to neighbours
5: for CRUn do
6: while (all x
n
do not converge to any common value x*)
7: if receive x
m
from neighbour m then
8: if x
m
x
n
> D then
9: Exclude m from the list of neighbours
10: else
11: calculate updated x
n
using eq on last slide
12: end if
13: end if
14: end while
15: if x
n
> then
16: PU is present
17: else
18: PU is absent
19: end if
20: end for
Fully Distributed Cooperative Spectrum Sensing for Cognitive Radio Ad Hoc Networks
Simulation Results (1)
Fully Distributed Cooperative Spectrum Sensing for Cognitive Radio Ad Hoc Networks
Simulation Results (2)
Fully Distributed Cooperative Spectrum Sensing for Cognitive Radio Ad Hoc Networks
Summary
We proposed a fully distributed and scalable cooperative
spectrum sensing scheme for CRAHNS.
CRUs exchange the local sensing information to neighbors and
converge after some iteration without the aid of any central
entity.
The point of convergence is compared with a predetermined
threshold to decide about the presence or absence of primary
user.
The major advantage of the proposed scheme is that it does not
require any prior knowledge about the degree of the network
thereby saving energy consumption.
It is shown in results that the proposed scheme can achieve the
performance as good as the consensus-based scheme with less
energy consumption.
Fully Distributed Cooperative Spectrum Sensing for Cognitive Radio Ad Hoc Networks
Acknowledgement
Fully Distributed Cooperative Spectrum Sensing for Cognitive Radio Ad Hoc Networks
QUESTIONS
Fully Distributed Cooperative Spectrum Sensing for Cognitive Radio Ad Hoc Networks