通过基于 JS-发散的改进信誉算法防御 CRN 中的主导合作概率攻击

IF 3 3区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pervasive and Mobile Computing Pub Date : 2024-03-27 DOI:10.1016/j.pmcj.2024.101921
Lingling Chen , Xuan Shen , Xiaohui Zhao , Ziwei Wang , Wei He , Guoji Xu , Yiyang Chen
{"title":"通过基于 JS-发散的改进信誉算法防御 CRN 中的主导合作概率攻击","authors":"Lingling Chen ,&nbsp;Xuan Shen ,&nbsp;Xiaohui Zhao ,&nbsp;Ziwei Wang ,&nbsp;Wei He ,&nbsp;Guoji Xu ,&nbsp;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":null,"pages":null},"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 ,&nbsp;Xuan Shen ,&nbsp;Xiaohui Zhao ,&nbsp;Ziwei Wang ,&nbsp;Wei He ,&nbsp;Guoji Xu ,&nbsp;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\":null,\"pages\":null},\"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}
引用次数: 0

摘要

无线通信服务的快速发展使得有限的频谱资源日益稀缺。认知无线电网络(CRN)中的合作频谱感知(CSS)是提高频谱利用率的一个有前途的解决方案。然而,CSS 容易受到拜占庭攻击。目前的研究表明,拜占庭攻击在攻击概率固定的情况下很容易防御。在这种情况下,我们在广义协作概率拜占庭攻击模型的基础上,根据实际情况提出了一种改进的攻击模型,称为主导合作概率攻击(DCPA)模型。这种 DCPA 模型包含发起攻击的辅助合作攻击者(ACA)和根据各自可信度确定 ACA 攻击概率区间的主导攻击者(DA)。DCPA 模型允许 ACA 灵活地发起攻击,而不会被传统的信誉防御算法识别出来,从而大大降低了 CSS 的传感性能。为了成功抵御 DCPA 模型对 CSS 的威胁,我们提出了一种基于 JS-发散的改进信誉算法,该算法可以区分诚实用户(HU)和攻击者。该算法通过分析两份连续的感知报告来识别诚实用户和攻击者在感知行为上的差异。通过 Python 仿真分析,我们证明了与广义合作概率攻击(CPA)模型和无攻击 CSS(AFC)模型相比,所提出的 DCPA 模型更具隐蔽性,对传统声誉防御算法性能的破坏性也明显更大。此外,我们的方法在最终数据融合过程中促进了 HU 的参与并抑制了攻击者,从而大大提高了 CSS 的性能。同时,与 PAM2 算法、传统投票规则(CVR)算法和传统声誉防御算法相比,我们提出的算法至少提高了 7%、15% 和 50%的检测性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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%.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Pervasive and Mobile Computing
Pervasive and Mobile Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
CiteScore
7.70
自引率
2.30%
发文量
80
审稿时长
68 days
期刊介绍: 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.
期刊最新文献
A controllability method on the social Internet of Things (SIoT) network INLEC: An involutive and low energy lightweight block cipher for internet of things Pressure distribution based 2D in-bed keypoint prediction under interfered scenes Blockchain-enhanced efficient and anonymous certificateless signature scheme and its application Can smartphones serve as an instrument for driver behavior of intelligent transportation systems research? A systematic review: Challenges, motivations, and recommendations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1