Lingling Chen , Xuan Shen , Xiaohui Zhao , Ziwei Wang , Wei He , Guoji Xu , Yiyang Chen
{"title":"通过基于 JS-发散的改进信誉算法防御 CRN 中的主导合作概率攻击","authors":"Lingling Chen , Xuan Shen , Xiaohui Zhao , Ziwei Wang , Wei He , Guoji Xu , Yiyang Chen","doi":"10.1016/j.pmcj.2024.101921","DOIUrl":null,"url":null,"abstract":"<div><p>Rapid advances in wireless communication services has made limited spectrum resources increasingly scarce. One promising solution for enhancing spectrum utilization is cooperative spectrum sensing (CSS) in cognitive radio networks (CRNs). However CSS is vulnerable to Byzantine attack. Current researches show that Byzantine attack is easily defended for their fixed attack probability. In this context, we propose an improved attack model called the dominated cooperative probabilistic attack (DCPA) model in the actual situation, building upon the generalized collaborative probabilistic Byzantine attack model. This DCPA model contains auxiliary cooperative attackers (ACAs) who launch attacks and a dominant attacker (DA) who determines ACAs’ attack probability intervals based on their respective credibility. The DCPA model allows ACAs to flexibly launch attacks, without being identified by the traditional reputation defense algorithm, significantly compromising the sensing performance of CSS. To successfully resist the threat posed by the DCPA model to CSS, we propose a JS-divergence-based improved reputation algorithm that can distinguish honest users (HUs) from attackers. This algorithm analyzes two consecutive sensing reports to identify differences in sensing behavior between HUs and attackers. Through Python simulation analysis, we demonstrate that, compared to the generalized cooperative probabilistic attack (CPA) model and the attack-free CSS (AFC) model, the proposed DCPA model is more concealed and significantly more disruptive to the performance of traditional reputation defense algorithms. Furthermore, our approach greatly enhances the performance of CSS by promoting the participation of HUs and suppressing attackers during the final data fusion. And also compared with the PAM2 algorithm, the conventional voting rule (CVR) algorithm and the traditional reputation defense algorithm, our proposed algorithm improves the detection performance by at least 7%, 15% and 50%.</p></div>","PeriodicalId":49005,"journal":{"name":"Pervasive and Mobile Computing","volume":"101 ","pages":"Article 101921"},"PeriodicalIF":3.0000,"publicationDate":"2024-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Defending dominant cooperative probabilistic attack in CRNs by JS-divergence-based improved reputation algorithm\",\"authors\":\"Lingling Chen , Xuan Shen , Xiaohui Zhao , Ziwei Wang , Wei He , Guoji Xu , Yiyang Chen\",\"doi\":\"10.1016/j.pmcj.2024.101921\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Rapid advances in wireless communication services has made limited spectrum resources increasingly scarce. One promising solution for enhancing spectrum utilization is cooperative spectrum sensing (CSS) in cognitive radio networks (CRNs). However CSS is vulnerable to Byzantine attack. Current researches show that Byzantine attack is easily defended for their fixed attack probability. In this context, we propose an improved attack model called the dominated cooperative probabilistic attack (DCPA) model in the actual situation, building upon the generalized collaborative probabilistic Byzantine attack model. This DCPA model contains auxiliary cooperative attackers (ACAs) who launch attacks and a dominant attacker (DA) who determines ACAs’ attack probability intervals based on their respective credibility. The DCPA model allows ACAs to flexibly launch attacks, without being identified by the traditional reputation defense algorithm, significantly compromising the sensing performance of CSS. To successfully resist the threat posed by the DCPA model to CSS, we propose a JS-divergence-based improved reputation algorithm that can distinguish honest users (HUs) from attackers. This algorithm analyzes two consecutive sensing reports to identify differences in sensing behavior between HUs and attackers. Through Python simulation analysis, we demonstrate that, compared to the generalized cooperative probabilistic attack (CPA) model and the attack-free CSS (AFC) model, the proposed DCPA model is more concealed and significantly more disruptive to the performance of traditional reputation defense algorithms. Furthermore, our approach greatly enhances the performance of CSS by promoting the participation of HUs and suppressing attackers during the final data fusion. And also compared with the PAM2 algorithm, the conventional voting rule (CVR) algorithm and the traditional reputation defense algorithm, our proposed algorithm improves the detection performance by at least 7%, 15% and 50%.</p></div>\",\"PeriodicalId\":49005,\"journal\":{\"name\":\"Pervasive and Mobile Computing\",\"volume\":\"101 \",\"pages\":\"Article 101921\"},\"PeriodicalIF\":3.0000,\"publicationDate\":\"2024-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Pervasive and Mobile Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1574119224000476\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pervasive and Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1574119224000476","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Defending dominant cooperative probabilistic attack in CRNs by JS-divergence-based improved reputation algorithm
Rapid advances in wireless communication services has made limited spectrum resources increasingly scarce. One promising solution for enhancing spectrum utilization is cooperative spectrum sensing (CSS) in cognitive radio networks (CRNs). However CSS is vulnerable to Byzantine attack. Current researches show that Byzantine attack is easily defended for their fixed attack probability. In this context, we propose an improved attack model called the dominated cooperative probabilistic attack (DCPA) model in the actual situation, building upon the generalized collaborative probabilistic Byzantine attack model. This DCPA model contains auxiliary cooperative attackers (ACAs) who launch attacks and a dominant attacker (DA) who determines ACAs’ attack probability intervals based on their respective credibility. The DCPA model allows ACAs to flexibly launch attacks, without being identified by the traditional reputation defense algorithm, significantly compromising the sensing performance of CSS. To successfully resist the threat posed by the DCPA model to CSS, we propose a JS-divergence-based improved reputation algorithm that can distinguish honest users (HUs) from attackers. This algorithm analyzes two consecutive sensing reports to identify differences in sensing behavior between HUs and attackers. Through Python simulation analysis, we demonstrate that, compared to the generalized cooperative probabilistic attack (CPA) model and the attack-free CSS (AFC) model, the proposed DCPA model is more concealed and significantly more disruptive to the performance of traditional reputation defense algorithms. Furthermore, our approach greatly enhances the performance of CSS by promoting the participation of HUs and suppressing attackers during the final data fusion. And also compared with the PAM2 algorithm, the conventional voting rule (CVR) algorithm and the traditional reputation defense algorithm, our proposed algorithm improves the detection performance by at least 7%, 15% and 50%.
期刊介绍:
As envisioned by Mark Weiser as early as 1991, pervasive computing systems and services have truly become integral parts of our daily lives. Tremendous developments in a multitude of technologies ranging from personalized and embedded smart devices (e.g., smartphones, sensors, wearables, IoTs, etc.) to ubiquitous connectivity, via a variety of wireless mobile communications and cognitive networking infrastructures, to advanced computing techniques (including edge, fog and cloud) and user-friendly middleware services and platforms have significantly contributed to the unprecedented advances in pervasive and mobile computing. Cutting-edge applications and paradigms have evolved, such as cyber-physical systems and smart environments (e.g., smart city, smart energy, smart transportation, smart healthcare, etc.) that also involve human in the loop through social interactions and participatory and/or mobile crowd sensing, for example. The goal of pervasive computing systems is to improve human experience and quality of life, without explicit awareness of the underlying communications and computing technologies.
The Pervasive and Mobile Computing Journal (PMC) is a high-impact, peer-reviewed technical journal that publishes high-quality scientific articles spanning theory and practice, and covering all aspects of pervasive and mobile computing and systems.