Malicious User Detection Based on Low-Rank Matrix Completion in Wideband Spectrum Sensing

被引:25
|
作者
Qin, Zhijin [1 ]
Gao, Yue [2 ]
Plumbley, Mark D. [3 ]
机构
[1] Univ Lancaster, Lancaster LA1 4YW, England
[2] Queen Mary Univ London, London E1 4NS, England
[3] Univ Surrey, Ctr Vis Speech & Signal Proc, Guildford GU2 7XH, Surrey, England
基金
欧盟地平线“2020”; 英国工程与自然科学研究理事会;
关键词
Cooperative spectrum sensing; low-rank matrix completion; malicious user detection; TV white space; COGNITIVE RADIO NETWORKS; ATTACK;
D O I
10.1109/TSP.2017.2759082
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In cognitive radio networks, cooperative spectrum sensing (CSS) has been a promising approach to improve sensing performance by utilizing spatial diversity of participating secondary users (SUs). In current CSS networks, all cooperative SUs are assumed to be honest and genuine. However, the presence of malicious users sending out dishonest data can severely degrade the performance of CSS networks. In this paper, a framework with high detection accuracy and low costs of data acquisition at SUs is developed, with the purpose of mitigating the influences of malicious users. More specifically, a low-rank matrix completion based malicious user detection framework is proposed. In the proposed framework, in order to avoid requiring any prior information about the CSS network, a rank estimation algorithm and an estimation strategy for the number of corrupted channels are proposed. Numerical results show that the proposed malicious user detection framework achieves high detection accuracy with lower data acquisition costs in comparison with the conventional approach. After being validated by simulations, the proposed malicious user detection framework is tested on the real-world signals over TV white space spectrum.
引用
收藏
页码:5 / 17
页数:13
相关论文
共 50 条
  • [31] ROBUST LOW-RANK MATRIX COMPLETION BY RIEMANNIAN OPTIMIZATION
    Cambier, Leopold
    Absil, P-A.
    [J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2016, 38 (05): : S440 - S460
  • [32] Bayesian Uncertainty Quantification for Low-Rank Matrix Completion
    Yuchi, Henry Shaowu
    Mak, Simon
    Xie, Yao
    [J]. BAYESIAN ANALYSIS, 2023, 18 (02): : 491 - 518
  • [33] The Algebraic Combinatorial Approach for Low-Rank Matrix Completion
    Kiraly, Franz J.
    Theran, Louis
    Tomioka, Ryota
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2015, 16 : 1391 - 1436
  • [34] PARALLEL MATRIX FACTORIZATION FOR LOW-RANK TENSOR COMPLETION
    Xu, Yangyang
    Hao, Ruru
    Yin, Wotao
    Su, Zhixun
    [J]. INVERSE PROBLEMS AND IMAGING, 2015, 9 (02) : 601 - 624
  • [35] Relaxed leverage sampling for low-rank matrix completion
    Kundu, Abhisek
    [J]. INFORMATION PROCESSING LETTERS, 2017, 124 : 6 - 9
  • [36] Local low-rank approach to nonlinear matrix completion
    Sasaki, Ryohei
    Konishi, Katsumi
    Takahashi, Tomohiro
    Furukawa, Toshihiro
    [J]. EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING, 2021, 2021 (01)
  • [37] MATRIX COMPLETION UNDER LOW-RANK MISSING MECHANISM
    Mao, Xiaojun
    Wong, Raymond K. W.
    Chen, Song Xi
    [J]. STATISTICA SINICA, 2021, 31 (04) : 2005 - 2030
  • [38] PARALLEL COMPUTING HEURISTICS FOR LOW-RANK MATRIX COMPLETION
    Hubbard, Charlie
    Hegde, Chinmay
    [J]. 2017 IEEE GLOBAL CONFERENCE ON SIGNAL AND INFORMATION PROCESSING (GLOBALSIP 2017), 2017, : 764 - 768
  • [39] UNIQUENESS OF LOW-RANK MATRIX COMPLETION BY RIGIDITY THEORY
    Singer, Amit
    Cucuringu, Mihai
    [J]. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2010, 31 (04) : 1621 - 1641
  • [40] Local low-rank approach to nonlinear matrix completion
    Ryohei Sasaki
    Katsumi Konishi
    Tomohiro Takahashi
    Toshihiro Furukawa
    [J]. EURASIP Journal on Advances in Signal Processing, 2021