A single iteration belief propagation algorithm to minimize the effects of primary user emulation attacks

Sasa Maric, S. Reisenfeld, L. Goratti
{"title":"A single iteration belief propagation algorithm to minimize the effects of primary user emulation attacks","authors":"Sasa Maric, S. Reisenfeld, L. Goratti","doi":"10.1109/ISPACS.2016.7824676","DOIUrl":null,"url":null,"abstract":"This paper presents a method to alleviate the effects of primary user emulation attacks in cognitive radio (CR) networks. The proposed method uses a simplified belief propagation (BP) algorithm that is able to identify whether a transmitter is a legitimate primary user or an attacker. In a primary user emulation attack (PUEA) a transmitter impersonates a primary user (PU) in order to deceive secondary users (SU) into believing that a channel is occupied. As a result, secondary users must vacate the channel immediately. This paper presents a simplified belief propagation method as a defence strategy against primary user emulation attacks. In our method each secondary user examines an incoming signal from a transmitter and determines with a certain probability whether the transmitter is a legitimate user or not. This probability is known as the belief. The beliefs at each secondary user are reconciled and a final belief is compared to a predefined threshold. If the final belief is below the threshold, the user is identified as an attacker. If it is above the threshold, the user is deemed a primary user. This result is then propagated throughout the network so that all users on the network are aware of the attacker. In this paper, we present a method based on the belief propagation framework. The proposed method converges in a single iteration; this is the result of a redefined messaging protocol and a simplified belief equation. As a result, the computational complexity of the method is reduced significantly, while still maintaining a high level of accuracy.","PeriodicalId":131543,"journal":{"name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"258 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPACS.2016.7824676","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

This paper presents a method to alleviate the effects of primary user emulation attacks in cognitive radio (CR) networks. The proposed method uses a simplified belief propagation (BP) algorithm that is able to identify whether a transmitter is a legitimate primary user or an attacker. In a primary user emulation attack (PUEA) a transmitter impersonates a primary user (PU) in order to deceive secondary users (SU) into believing that a channel is occupied. As a result, secondary users must vacate the channel immediately. This paper presents a simplified belief propagation method as a defence strategy against primary user emulation attacks. In our method each secondary user examines an incoming signal from a transmitter and determines with a certain probability whether the transmitter is a legitimate user or not. This probability is known as the belief. The beliefs at each secondary user are reconciled and a final belief is compared to a predefined threshold. If the final belief is below the threshold, the user is identified as an attacker. If it is above the threshold, the user is deemed a primary user. This result is then propagated throughout the network so that all users on the network are aware of the attacker. In this paper, we present a method based on the belief propagation framework. The proposed method converges in a single iteration; this is the result of a redefined messaging protocol and a simplified belief equation. As a result, the computational complexity of the method is reduced significantly, while still maintaining a high level of accuracy.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
采用单次迭代信念传播算法,最大限度地减少主用户仿真攻击的影响
提出了一种在认知无线电(CR)网络中减轻主用户仿真攻击影响的方法。该方法采用一种简化的信念传播(BP)算法,能够识别发送者是合法的主用户还是攻击者。在主用户模拟攻击(PUEA)中,发射机模仿主用户(PU)以欺骗辅助用户(SU),使其相信信道已被占用。因此,辅助用户必须立即腾出通道。本文提出了一种简化的信念传播方法作为主用户仿真攻击的防御策略。在我们的方法中,每个辅助用户检查来自发射机的传入信号,并以一定的概率确定发射机是否是合法用户。这种可能性被称为信念。对每个次要用户的信念进行协调,并将最终信念与预定义的阈值进行比较。如果最终信念低于阈值,则将该用户识别为攻击者。如果超过阈值,则认为该用户是主用户。然后,这个结果在整个网络中传播,以便网络上的所有用户都知道攻击者。本文提出了一种基于信念传播框架的方法。该方法在单次迭代中收敛;这是重新定义的消息传递协议和简化的信念方程的结果。因此,该方法的计算复杂度大大降低,同时仍保持较高的精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
SDN experimental on the PSU network Time frequency analysis: A sparse S transform approach Automatic rule registration and deletion function on a packet lookup engine LSI Study on the latency efficient IFFT design method for low latency communication systems An inverse tone mapping operator based on Reinhard's global operator
×
引用
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