基于背靠背协调的学习方案,用于欺骗分布式网络中的被动干扰器

IF 1.5 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC IET Communications Pub Date : 2024-05-08 DOI:10.1049/cmu2.12758
Yihang Du, Yu Zhang, Pengzhi Qian, Panfeng He, Wei Wang, Yifei Chen, Yong Chen
{"title":"基于背靠背协调的学习方案,用于欺骗分布式网络中的被动干扰器","authors":"Yihang Du,&nbsp;Yu Zhang,&nbsp;Pengzhi Qian,&nbsp;Panfeng He,&nbsp;Wei Wang,&nbsp;Yifei Chen,&nbsp;Yong Chen","doi":"10.1049/cmu2.12758","DOIUrl":null,"url":null,"abstract":"<p>Reactive jammers select jamming strategies according to the users’ responses; thus, conventional anti-jamming methods such as frequency hopping are inadequate to defeat the jamming attack. In this article, the authors propose a novel uncoupled deception scheme to trap the reactive jammer into attacking a decoy channel in distributed networks. Specifically, the authors design a multi-functional network utility for every user to mislead the jammer with a minimum energy consumption while achieving the highest network throughput. Based on the network utility, the anti-jamming problem is formulated as an exact potential game such that the existence of Nash equilibrium can be guaranteed theoretically. The authors further propose a back-to-back coordination-based learning algorithm to reach the optimal channel selection and power adaption in a non-cooperative way. To alleviate the lack of mutual information exchange, the back-to-back coordination mechanism derives all users to deceive the jammer by inferring others’ strategies based on a shared belief. Simulation results show that the proposed algorithm yields higher network throughput and efficiency-cost ratio compared to the state-of-the-art cooperative schemes.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 10","pages":"597-611"},"PeriodicalIF":1.5000,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12758","citationCount":"0","resultStr":"{\"title\":\"A back-to-back coordination-based learning scheme for deceiving reactive jammers in distributed networks\",\"authors\":\"Yihang Du,&nbsp;Yu Zhang,&nbsp;Pengzhi Qian,&nbsp;Panfeng He,&nbsp;Wei Wang,&nbsp;Yifei Chen,&nbsp;Yong Chen\",\"doi\":\"10.1049/cmu2.12758\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Reactive jammers select jamming strategies according to the users’ responses; thus, conventional anti-jamming methods such as frequency hopping are inadequate to defeat the jamming attack. In this article, the authors propose a novel uncoupled deception scheme to trap the reactive jammer into attacking a decoy channel in distributed networks. Specifically, the authors design a multi-functional network utility for every user to mislead the jammer with a minimum energy consumption while achieving the highest network throughput. Based on the network utility, the anti-jamming problem is formulated as an exact potential game such that the existence of Nash equilibrium can be guaranteed theoretically. The authors further propose a back-to-back coordination-based learning algorithm to reach the optimal channel selection and power adaption in a non-cooperative way. To alleviate the lack of mutual information exchange, the back-to-back coordination mechanism derives all users to deceive the jammer by inferring others’ strategies based on a shared belief. Simulation results show that the proposed algorithm yields higher network throughput and efficiency-cost ratio compared to the state-of-the-art cooperative schemes.</p>\",\"PeriodicalId\":55001,\"journal\":{\"name\":\"IET Communications\",\"volume\":\"18 10\",\"pages\":\"597-611\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2024-05-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12758\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IET Communications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1049/cmu2.12758\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Communications","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/cmu2.12758","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

反应式干扰器会根据用户的反应选择干扰策略;因此,跳频等传统抗干扰方法不足以击败干扰攻击。在本文中,作者提出了一种新颖的非耦合欺骗方案,以诱使被动干扰者攻击分布式网络中的诱饵信道。具体来说,作者为每个用户设计了一个多功能网络实用程序,以最小的能耗误导干扰者,同时实现最高的网络吞吐量。基于网络效用,反干扰问题被表述为一个精确的潜在博弈,从而从理论上保证了纳什均衡的存在。作者进一步提出了一种基于背靠背协调的学习算法,以非合作的方式实现最优信道选择和功率自适应。为了缓解缺乏相互信息交流的问题,背靠背协调机制推导出所有用户基于共同信念,通过推断他人的策略来欺骗干扰者。仿真结果表明,与最先进的合作方案相比,所提出的算法能产生更高的网络吞吐量和效率成本比。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A back-to-back coordination-based learning scheme for deceiving reactive jammers in distributed networks

Reactive jammers select jamming strategies according to the users’ responses; thus, conventional anti-jamming methods such as frequency hopping are inadequate to defeat the jamming attack. In this article, the authors propose a novel uncoupled deception scheme to trap the reactive jammer into attacking a decoy channel in distributed networks. Specifically, the authors design a multi-functional network utility for every user to mislead the jammer with a minimum energy consumption while achieving the highest network throughput. Based on the network utility, the anti-jamming problem is formulated as an exact potential game such that the existence of Nash equilibrium can be guaranteed theoretically. The authors further propose a back-to-back coordination-based learning algorithm to reach the optimal channel selection and power adaption in a non-cooperative way. To alleviate the lack of mutual information exchange, the back-to-back coordination mechanism derives all users to deceive the jammer by inferring others’ strategies based on a shared belief. Simulation results show that the proposed algorithm yields higher network throughput and efficiency-cost ratio compared to the state-of-the-art cooperative schemes.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IET Communications
IET Communications 工程技术-工程:电子与电气
CiteScore
4.30
自引率
6.20%
发文量
220
审稿时长
5.9 months
期刊介绍: IET Communications covers the fundamental and generic research for a better understanding of communication technologies to harness the signals for better performing communication systems using various wired and/or wireless media. This Journal is particularly interested in research papers reporting novel solutions to the dominating problems of noise, interference, timing and errors for reduction systems deficiencies such as wasting scarce resources such as spectra, energy and bandwidth. Topics include, but are not limited to: Coding and Communication Theory; Modulation and Signal Design; Wired, Wireless and Optical Communication; Communication System Special Issues. Current Call for Papers: Cognitive and AI-enabled Wireless and Mobile - https://digital-library.theiet.org/files/IET_COM_CFP_CAWM.pdf UAV-Enabled Mobile Edge Computing - https://digital-library.theiet.org/files/IET_COM_CFP_UAV.pdf
期刊最新文献
A deep learning-based approach for pseudo-satellite positioning Analysis of interference effect in VL-NOMA network considering signal power parameters performance An innovative model for an enhanced dual intrusion detection system using LZ-JC-DBSCAN, EPRC-RPOA and EG-GELU-GRU A high-precision timing and frequency synchronization algorithm for multi-h CPM signals Dual-user joint sensing and communications with time-divisioned bi-static radar
×
引用
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