Distributed Spectrum Sensing For Cognitive Radio Systems: Claudio R. C. M. Da Silva, Brian Choi, and Kyouwoong Kim
Distributed Spectrum Sensing For Cognitive Radio Systems: Claudio R. C. M. Da Silva, Brian Choi, and Kyouwoong Kim
Network, to
substantially improve and extend the Available Resoure Maps (AMRs) that are the focus of this paper on moving towards Cogntive Radio
Systems or Networks (as opposed to simply Cognitive Radios).
There is no question that Cogntive Radio Newtorks are the future of wireless and are especially needed, and cost justified even now, for:
Smart Transport, Energy, Environment Radio (STEER) and complimentary wireless (e.g., precision agriculture and resouce manangemnet use
and protection) for core infrastructure and wide-georgraphy industries for the US and all nations.
spectrum sensing. In such a distributed approach, the spectrum occupancy is determined by the joint work of cognitive
radios, as opposed to being determined individually by each
cognitive radio. In this paper, we consider different aspects
of the processing and fusion of spectrum sensing information
of cognitive radio systems. A new system architecture that
combines cognitive radios and available resource maps is
also discussed. A major focus of this paper is on the use of
cyclic feature-based methods for distributed signal detection
and classification.
I. I NTRODUCTION
k ,
p (yk |H0 ) uk =0 P (H1 )
(1)
where
P
uk
k = P
uk
u0 = 1|uk1 P
`
u0 = 1|uk1 P
`
QN
u0 = 1|uk0
i=1,i!=k P (ui |H0 )
,
`
QN
u0 = 1|uk0
i=1,i!=k P (ui |H1 )
needed in
mesh net
anyway,
especially
mobile ad
hoc mesh
net
CR fusion center
0.9
0.8
0.7
0.6
1, 3, 10 sensors
0.5
0.4
0.3
0.2
u
)0
Fig. 1.
Probability of Detection
#
Phenomenon
"
%%$
!! #
!
%
y1 !
y2 #
yN%
!
%%
!
#
"
!
$
#
&
%
...
CR node 1
CR node 2
CR node N
%
!
%
'
u1%
u2
uN !!
%
'
!
%% '
!
(
& '
%
"!
!
uk
=
(u1 , . . . , uk1 , uk+1 , . . . , uN )
and ukj
=
T
(u1 , . . . , uk1 , uk = j, uk+1 , . . . , uN ) , j = 0, 1. The
fusion rule is also a threshold test, and is given by
"
#
"
##
N "
!
1 P Mi
P Mi
ui log
+ (1 ui ) log
PFi
1 PFi
i=1
"
#
u0 =1
P (H0 )
log
. (2)
P (H1 )
u0 =0
Thus, the person-by-person optimization solution to the binary
decentralized Bayesian hypothesis testing problem is given by
a system of nonlinear coupled equations. It is well-known
that the computational effort required to solve a system of
nonlinear coupled equations increases rapidly with the number of detectors. Tsitsiklis and Athans show in their classic
paper [10] that even the simplest problems of decentralized
decision making are hard from an algorithmic viewpoint, and
that it becomes an NP-complete problem if the measurements
at each sensor are not independent.
As the testing functions at both the local detectors and
at the data fusion center have the form of a likelihood
ratio, the decision thresholds are the only free parameters.
Therefore, the distributed detection problem reduces to the
search of the optimal threshold. One possible way to find
these optimal thresholds is by using iterative computational
algorithms. For example, a nonlinear Gauss-Seidel iterative
algorithm derived in [11] allows for the solution of reasonably
large-sized problems, at the expense of requiring messages
to be transmitted among fusion center and CR nodes. Other
possible iterative algorithms can be found in [9].
III. D ISTRIBUTED S IGNAL D ETECTION U SING
S INGLE -C YCLE D ETECTORS
Cognitive radios must be able to detect spectrum usage with
no a priori knowledge of modulation format and characteristics, such as the bandwidth, carrier frequency, and chip-rate,
of primary systems. The most conventional approach for the
detection of an unknown deterministic signal in AWGN is
the radiometer, which is simply a measure of received energy
in time and frequency. However, it is well-known that such
a method is highly susceptible to unknown and changing
noise levels and interference [12]. Cyclic-feature detection
0.1
0
0.2
0.4
0.6
Probability of False Alarm
0.8
$
SxT (t, f ) SS (f ) df $$ ,
(3)
$
H0
2 ) du
x (u) e
SxT (t, f ) =
T
t T2
&% T
'
t+ 2
j2 (f
u
)
2
x (u) e
du ,(4)
t T2
0.9
0.8
0.7
0.6
0.5
0.4
0.3
0.2
0.1
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
Fig. 3.
Fig. 5.
0.9
0.8
0.7
0.6
0.5
0.4
0.3
0.2
0.1
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
Fig. 4.
Fig. 6.
the inherent cyclostationarity existent in digital signals, cyclicfeature algorithms have the potential to provide reliable signal
classification even at low signal-to-noise ratio scenarios.
Cyclic-feature algorithms for signal classification typically
use the spectral coherence function of the received signal,
defined as [15]
Cx (f ) =
[Sx0 (f
Sx (f )
.
+ /2)Sx0 (f /2)]1/2
f 0 T
(6)
where
SxT (t, f )f =
1
f
f +f /2
f f /2
(5)
(7)
(8)
SkyTel believes this sort of AMR-agumented Cognitive Radio (CR) network idea can be much fruther ehanced by the CR radios and network employing near-constant
sub-foot-level High Accuracy Location (HALO) in the participating CR radios. HALO determination can be used, with time-matched, near-constant spectrum-use
sensing of each radio in all times of day and season. These two correlated measurements can be used to build a map of the wireless network geographic region and
how, on a cubic-foot to cubic-foot basis, the radio signals propagate and interacte (including co-channel [CC] and adjacent-channel [AC] RF multipath. With known
fixed-station tranceivers, and the mobile received moving in various patterns, this will of course result in a massive database, but those are not cheap to store, build on,
and utilze. The resolution / accuracy would improve over time, the more the above paried measurements take place over the whole Network region. (Continued below.)
(Continued from above.) If (as SkyTel Plans for its networks) the Network knew all authorized users, and they were all using this form of CR on the
Network, then, after said Resolution/ Accuracy was sufficiently developed by the increasingly knowledgable Network, it would be able to instruct each
radio at each place and time what spectrum it may use without interference to and from other users-- based upon past experiences. This should
subtantially (1) shorten the time of these determinations, and (2) decrease the resources (power and distributed-mesh radio reporting as described in
this paper) needed by each mobile radio, for the determinations, (3) provide an alternative, historical source of this detemination to the real-time
spectrum-use sensing of the radio, etc. (4) It would be able to track all radios precisely and perform a "traffic cop" role as the radios move around the
Network, and their authorized services and priorities change. Thus, HALO may play a vital role in "Cogintive Radio Networks."