2013 IEEE Wireless Communications and Networking Conference (WCNC) 2013
DOI: 10.1109/wcnc.2013.6554634
|View full text |Cite
|
Sign up to set email alerts
|

A cooperative spectrum sensing scheme based on the Bayesian reputation model in cognitive radio networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(4 citation statements)
references
References 13 publications
0
4
0
Order By: Relevance
“…• Using prioritized sequential probability ratio test [29], and fine-grained reputation management [30], to enable robust data fusion.…”
Section: Overviewmentioning
confidence: 99%
See 1 more Smart Citation
“…• Using prioritized sequential probability ratio test [29], and fine-grained reputation management [30], to enable robust data fusion.…”
Section: Overviewmentioning
confidence: 99%
“…In fact, for all the possible pairs of users malicious and non-malicious, we calculate the probability of giving the malicious users bigger reputation than the normal user. This defined error probability of estimated weight is plotted as a function of the number of iterations where after each 10 iterations, we change the number of malicious users (30,60, and 90 out of 195). First, that we can remark that during the first 10 iterations (10 malicious users), IPMCD was not able to distinguish the malicious users (P W = 0.5) since they have no sufficient number of groups nor iterations (0.5 for IPMCD and 0.36 for IPMCD-A).…”
Section: Simulation Setupmentioning
confidence: 99%
“…An ordinary SSDF attack is also known as a “Byzantine attack” [ 8 ], and its attack methods mainly include the following: “always yes”, “always no”, “always false”, and “Ffixed probability”. In order to defend against ordinary SSDF attacks, some scholars have conducted corresponding research [ 9 , 10 , 11 , 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 , 20 , 21 ]. In [ 12 ], a method based on Bayesian detection was used to defend against SSDF attacks, but it needs to detect a fixed number of nodes, which consumes a large amount of energy on the system.…”
Section: Introductionmentioning
confidence: 99%
“…In order to defend against ordinary SSDF attacks, some scholars have conducted corresponding research [ 9 , 10 , 11 , 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 , 20 , 21 ]. In [ 12 ], a method based on Bayesian detection was used to defend against SSDF attacks, but it needs to detect a fixed number of nodes, which consumes a large amount of energy on the system. Lu et al explained that when a system is attacked by SSDF independently or jointly launched by MUs [ 13 ], it can defend against malicious users (MUs) with the help of trusted SUs, that is, by only relying on the data of trusted SUs during data fusion, it can find MUs.…”
Section: Introductionmentioning
confidence: 99%