2017
DOI: 10.1016/j.comcom.2017.08.007
|View full text |Cite
|
Sign up to set email alerts
|

Theoretical stopping criteria guided Greedy Algorithm for Compressive Cooperative Spectrum Sensing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 36 publications
0
1
0
Order By: Relevance
“…Collaborative spectrum sensing (CSS) technology is one of the key solutions to CR technical problems. Most of the existing research builds models and algorithms under fading channel conditions, and use the spatial diversity of multi-nodes sensing to achieve the purpose of reducing sensing cost or improving sensing robustness [7][8][9][10][11][12]. However, when users provide false sensing results maliciously, the performance and security of spectrum sensing will be significantly affected [13] Zhang Linyuan et al discuss various situations of Byzantine attack and defense in reputation-based cooperative spectrum sensing [14].…”
Section: Introductionmentioning
confidence: 99%
“…Collaborative spectrum sensing (CSS) technology is one of the key solutions to CR technical problems. Most of the existing research builds models and algorithms under fading channel conditions, and use the spatial diversity of multi-nodes sensing to achieve the purpose of reducing sensing cost or improving sensing robustness [7][8][9][10][11][12]. However, when users provide false sensing results maliciously, the performance and security of spectrum sensing will be significantly affected [13] Zhang Linyuan et al discuss various situations of Byzantine attack and defense in reputation-based cooperative spectrum sensing [14].…”
Section: Introductionmentioning
confidence: 99%