Defending Against SSDF Attacks From Randomly Appearing Intelligent Malicious Vehicle Users in the CIoV Network by Bayesian Stackelberg Game

被引:0
|
作者
Li, Fushuai [1 ]
Lin, Ruiquan [1 ]
Chen, Wencheng [1 ]
Wang, Jun [1 ]
Hu, Jinsong [2 ]
Shu, Feng [3 ,4 ]
机构
[1] Fuzhou Univ, Coll Elect Engn & Automat, Fuzhou 350108, Peoples R China
[2] Fuzhou Univ, Coll Phys & Informat Engn, Fuzhou 350108, Peoples R China
[3] Hainan Univ, Sch Informat & Commun Engn, Haikou 570228, Peoples R China
[4] Nanjing Univ Sci & Technol, Sch Elect & Opt Engn, Nanjing 210094, Peoples R China
关键词
Sensors; Games; Optimization; Internet of Vehicles; Intelligent sensors; Random processes; Bayes methods; Cognitive Internet of Vehicles (CIoVs); game theory; physical layer security; spectrum sensing data falsification (SSDF) attacks; COGNITIVE RADIO NETWORKS; VEHICULAR COMMUNICATIONS; BYZANTINE ATTACK; SPECTRUM; IDENTIFICATION; ALLOCATION; STRATEGY;
D O I
10.1109/JSEN.2024.3445584
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This article proposes an incomplete information Bayesian Stackelberg game, which is adapted to the Cognitive Internet of Vehicles (CIoVs) network to defend against spectrum sensing data falsification (SSDF) attacks from malicious vehicle users (MVUs). Specifically, this article considers the random appearance of MVUs caused by mobility, intelligent SSDF attacks of MVUs, and the different spectrum sensing performances among vehicle users (VUs). In the game, the fusion center (FC) as the leader aims to improve the global detection performance while effectively identifying the identities of different VUs by optimizing the global decision threshold and the reputation threshold. On the other hand, this article models the random appearance of MVUs as a Poisson random process, and the MVUs are the intelligent followers; they optimize the attack probabilities according to the FC's strategies to evade detection and increase the chance of selfish transmission and the damage to the CIoV network. To solve the MVUs' nonconvex optimization problem, this article uses the successive convex approximation (SCA) technique to obtain MVUs' optimal attack probabilities. For the FC, this article proposes the method combining alternating optimization and SCA to solve the nonconvex optimization problem of the FC and obtain its optimal defense strategies. This article also proves the convergence of the proposed method and the existence of the Stackelberg equilibrium (SE). The simulation results demonstrate the validity and superiority of the proposed method compared with traditional methods.
引用
收藏
页码:31310 / 31323
页数:14
相关论文
共 4 条
  • [1] A Fast Method to Defend Against SSDF Attacks in the CIoV Network: Based on DAG Blockchain and Evolutionary Game
    Li, Fushuai
    Lin, Ruiquan
    Wang, Jun
    Hu, Jinsong
    Shu, Feng
    Wu, Liang
    IEEE COMMUNICATIONS LETTERS, 2023, 27 (12) : 3171 - 3175
  • [2] Defending Against Massive SSDF Attacks From a Novel Perspective of Honest Secondary Users
    Sun, Zhiguo
    Xu, Zhenyu
    Hammad, Muhammad Zahid
    Ning, Xiaoyan
    Wang, Qiuying
    Guo, Lili
    IEEE COMMUNICATIONS LETTERS, 2019, 23 (10) : 1696 - 1699
  • [3] Defending Against DDOS Attacks on IoT Network Throughput: A Trust-Stackelberg Game Model
    Qi, Chunyang
    Huang, Jie
    Huang, Cheng
    Wu, Huaqing
    Shen, Xuemin
    2022 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM 2022), 2022, : 6259 - 6264
  • [4] Thwarting SSDF Attacks From High-Speed Movement VUs in the CIoV Network: Based on Blockchain and Stochastic Evolutionary Game
    Li, Fushuai
    Lin, Ruiquan
    Chen, Wencheng
    Wang, Jun
    Shu, Feng
    Chen, Riqing
    IEEE INTERNET OF THINGS JOURNAL, 2025, 12 (02): : 2233 - 2250