Documente Academic
Documente Profesional
Documente Cultură
discussions, stats, and author profiles for this publication at: http://www.researchgate.net/publication/281629766
CITATION
READS
70
3 AUTHORS:
Efe Orumwense
Thomas Afullo
University of KwaZulu-Natal
University of KwaZulu-Natal
6 PUBLICATIONS 5 CITATIONS
SEE PROFILE
SEE PROFILE
Viranjay Srivastava
University of KwaZulu-Natal
45 PUBLICATIONS 105 CITATIONS
SEE PROFILE
efe.orumwense@gmail.com
2
Afullot@ukzn.ac.za
3
viranjay@ieee.org
I. INTRODUCTION
With the recent advances in wireless communication
technology, Cognitive Radio (CR) has gradually paved its
way into modern day technology becoming more popular by
the day and evolving to become an alluring and attractive
solution to spectral congestion and shortage problems [1]. In
a Cognitive Radio Network (CRN), a Cognitive Radio User
(CRU) or unlicensed user can opportunistically use an unused
portion of spectrum belonging to a licensed user without a
license. In order to avoid interference with the licensed user
during this process, the CRU should have a prior knowledge
about the status of the spectrum, either it is being used or
vacant before using it. This prior knowledge about the status
of the spectrum is gained through a process called spectrum
sensing [2].
In a spectrum sensing process, each unlicensed user is
equipped with cognitive radio to detect a targeted licensed
spectrum and logically decide if the spectrum is free or
vacant. In the vein to enhancing the performance of the
process, multiple CRU can effectively cooperate with each
other to conduct spectrum sensing, a term in literature
commonly known as Cooperative Spectrum Sensing (CSS)
[3] [4]. Cooperative spectrum sensing allows each cognitive
radio to perform local spectrum sensing independently and
then makes a binary decision and forwards this decision to a
Page 431
( )
( ) (
(1)
(2)
( ) ( )
(
)
(3)
{
used by a licensed user is denoted by
. To avoid
interference, each CRU senses a specific spectrum at a
* +
specific time and takes a local binary decision
( ) ( )
about the availability of the spectrum. If the decision
(
)
(4)
{
is taken then the CRU decides that the spectrum is being used.
If otherwise, then the CRU decides that the spectrum is
vacant.
where is a predefined threshold on the number of CRUs
who detect a user on the spectrum.
is the probability of
After a local binary decision have been taken by all the detection for each individual CRU. In equation (1) and (2),
CRUs and sent to the FC, the FC receives these decisions and
when
, the final decision will be 1 since the FC will
fuses them by using specific fusion rules (FR) to make a final
always receive a number of 1s larger than or equal to K
decision. There are many fusion rules that can be applied at
reported by the malicious users. But when
, the lower
the FR [12]. In this work, we will be focusing on the logic OR
bound summation will be decreased by .
rule and the logic AND rule because in these rules, given a
and
are the probability of detection and false alarm
targeted probability of detection or a targeted probability of
respectively
in the local spectrum sensing process of any of
false alarm, each CRU threshold can be derived. In OR rule,
the FC will declare the spectrum busy when at least one of the
Page 432
),
),
(6)
where
indicates that th CRU has decided that a licensed
signal is present,
and
indicates the presence and
absence of a licensed user signal respectively.
The effect of malicious users on the overall performance
of the network can be seen in
and . An increase in
creates a more efficient network while a decrease in
degrades the efficient usage of the unused spectrum. In
formulating the effects of malicious users on the networks
resources, we define Energy efficiency metric ( ) as the ratio
of the total successfully transmitted bits to the total number of
energy consumed by the legitimate CRUs. Data can only be
successfully transmitted if the spectrum is vacant and no false
alarm is reported, which results to non-zero efficiency.
The average energy efficiency ( ) can be expressed as
(
(7)
) (
) (
),
(8)
) and (
) are conditional probabilities
where (
regarding the presence and absence of fake PUEA attacker
signals which are related to the attacker strategy. Considering
(
) and (
) as constant values, for simplicity
of notations, we can denote is as
Page 433
(9)
(10)
(5)
and
(
(
and
(
where
denotes the presence of an attacker. We can
therefore rewrite equation (8) as
(
)(
(11)
(12)
),
(14)
(
(
(
)
)
)
+
*
*
+
+
(15)
)
)
(16)
(17)
TABLE I
PARAMETERS USED FOR SIMULATION
Parameter
(
Value
0.5
0.8
( )
(18)
0.2
0.3s
( )
( )
(19)
3000
( )
(20)
( )
(21)
( )
(22)
( )
(23)
2500
Energy Efficiency. (Bit/Joule)
2000
1500
1000
500
1
3
4
5
Number of malicious users(M)
where
(
) and
(
) can easily be obtained by
replacing by in equation (1) (4) respectively.
By the same way, the achievable energy efficiency in our
proposed secure CSS (
) can be updated as follows
(
3500
(24)
where
, is the energy consumed by one
CRU during the local spectrum sensing and is the energy
required to report its one bit spectrum occupancy information
to the FC.
IV. SIMULATION RESULTS
We have implemented the simulations on a cognitive
radio network consisting of 10 legitimate users ( ) . The
simulation parameters used as regards the energy efficiency
and network specifications are given in Table 1.
3000
2500
OR Fusion Rule
AND Fusion Rule
2000
1500
1000
500
0.1
0.2
0.3
0.4
0.5
0.6
Probability of false alarm (Pfa)
0.7
0.8
Page 434
0.9
[5]
[9]
[6]
[7]
[8]
[10]
[11]
[12]
[13]
[14]
[15]
Efe Francis Orumwense received his B.Sc (Hons) degree from the
School of Engineering, University of Benin, Benin City, Nigeria in
2009. He also received a Masters degree from the School of
Electrical Electronic and Computer Engineering, University of
KwaZulu-Natal, Durban, South Africa in 2014. He is currently
working towards a PhD from the same institution. His research
interest includes Orthogonal frequency division multiplexing
systems, cognitive radio technology, wireless network security and
energy efficiency systems.
REFERENCES
[1]
[2]
[3]
[4]
Page 435