An Analytical Model for Primary User Emulation Attacks in Cognitive Radio Networks
read more
Citations
Security Aspects in Software Defined Radio and Cognitive Radio Networks: A Survey and A Way Ahead
Detecting Primary User Emulation Attacks in Dynamic Spectrum Access Networks
Dogfight in Spectrum: Combating Primary User Emulation Attacks in Cognitive Radio Systems—Part II: Unknown Channel Statistics
Survey of Security Issues in Cognitive Radio Networks
Cooperative Spectrum Sensing in Cognitive Radio Networks in the Presence of the Primary User Emulation Attack
References
Wireless Communications: Principles and Practice
Cognitive radio: brain-empowered wireless communications
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey
IEEE 802.22: the first worldwide wireless standard based on cognitive radios
The Sum of Log-Normal Probability Distributions in Scatter Transmission Systems
Related Papers (5)
Frequently Asked Questions (9)
Q2. What have the authors stated for future works in "An analytical model for primary user emulation attacks in cognitive radio networks" ?
This is the first analytical treatment to study the feasibility of a PUEA. Extension of their approach to determine the lower bounds for the probability of successful PUEA in systems deploying other spectrum sensing mechanisms described in [ 6 ] is a topic for further investigation.
Q3. How many users are present in a circle?
All secondary and malicious users are distributed in a circular grid of radius R. A primary transmitter is present at a distance of at least Dp from all the users.
Q4. What is the probability of a successful PUEA?
If the measurement is based on a single energy threshold, then even a single malicious user transmitting at sufficiently large power can cause a successful PUEA.
Q5. What is the RF signal from the primary transmitter to the ith secondary user?
The shadowing random variable from the jth malicioususer to the ith secondary user is (Gij) 2 = 10 ξij10 , where ξij ∼ N ( 0, σ2m ). •
Q6. how can i obtain the lower bound on a succesful PUEA?
(15)The expectation E [ P (m) r (i) ] can then be obtained asE [ P (m)r (i) ] = 1π(R2 − R20) e1 2 a 2σ̂2∫ 2πθj=0∫ Rrj=R0eaµ̂rjdrjdθj . (16)Using the expression for distance between two points in polar co-ordinates given by Eqn. (9), the above can be simplified and obtained asE [ P (m)r (i) ] = M 12R20(R 2 − R20)e 1 2a 2σ̂2∆. (17)By fixing the co-ordinates of a secondary user at (0, 0), E [ P (p) r (i) ]is obtained by removing the integration in Eqn. (8) asE [ P (p)r (i) ] = Pte1 2a 2σ2p∆r2p . (18)The expression for E [ P (m) r (i) ] from Eqn. (17) andE [ P (p) r (i) ]from Eqn. (18) are substituted in Eqn. (7) to obtain the lower bound on a succesful PUEA on a secondary user.
Q7. What is the probability of a PUEA?
In this case also, a set of malicious users can transmit in such a way that the total received power at a good secondary user due to the transmission by all the malicious users is very close to that due to the transmission from the primary transmitter, thus resulting in a primary user emulation attack (PUEA).
Q8. How many integrations can be performed to obtain the probability of a successful PUEA?
The probability of a successful PUEA, pPUEA defined in Eqn. (4) can be obtained by averaging p̂PUEA in Eqn. (5) over the positions of the secondary and malicious users and the Rayleigh fading from the primary and all the malicious users to the secondary user.
Q9. How many times can a PUEA be obtained?
Conditioned on the Rayleigh fading random variables from the primary and all the malicious users to the secondary user i and the positions of the secondary user and all the malicious users, the probability of a successful PUEA, p̂PUEA, can be obtained asp̂PUEA = 1 − Q(ǫdB + µd(i)σd(i))−