Dynamic adversarial jamming-based reinforcement learning for designing constellations

IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Digital Communications and Networks Pub Date : 2024-10-01 DOI:10.1016/j.dcan.2023.05.012
Yizhou Xu , Haidong Xie , Nan Ji , Yuanqing Chen , Naijin Liu , Xueshuang Xiang
{"title":"Dynamic adversarial jamming-based reinforcement learning for designing constellations","authors":"Yizhou Xu ,&nbsp;Haidong Xie ,&nbsp;Nan Ji ,&nbsp;Yuanqing Chen ,&nbsp;Naijin Liu ,&nbsp;Xueshuang Xiang","doi":"10.1016/j.dcan.2023.05.012","DOIUrl":null,"url":null,"abstract":"<div><div>To resist various types of jamming in wireless channels, appropriate constellation modulation is used in wireless communication to ensure a low bit error rate. Due to the complexity and variability of the channel environment, a simple preset constellation is difficult to adapt to all scenarios, so the online constellation optimization method based on Reinforcement Learning (RL) shows its potential. However, the existing RL technology is difficult to ensure the optimal convergence efficiency. Therefore, in this paper, Dynamic Adversarial Interference (DAJ) waveforms are introduced and the DAJ-RL method is proposed by referring to adversarial training in Deep Learning (DL). The algorithm can converge to the optimal state quickly by self-adaptive power and probability direction of dynamic strong adversary of DAJ. In this paper, a rigorous theoretical proof of the symbol error rate is given and it is shown that the method approaches the mathematical limit. Also, numerical and hardware experiments show that the constellations generated by DAJ-RL have the best error rate at all noise levels. In the end, the proposed DAJ-RL method effectively improves the RL-based anti-jamming modulation for cognitive electronic warfare.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"10 5","pages":"Pages 1471-1479"},"PeriodicalIF":7.5000,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Digital Communications and Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2352864823000937","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

To resist various types of jamming in wireless channels, appropriate constellation modulation is used in wireless communication to ensure a low bit error rate. Due to the complexity and variability of the channel environment, a simple preset constellation is difficult to adapt to all scenarios, so the online constellation optimization method based on Reinforcement Learning (RL) shows its potential. However, the existing RL technology is difficult to ensure the optimal convergence efficiency. Therefore, in this paper, Dynamic Adversarial Interference (DAJ) waveforms are introduced and the DAJ-RL method is proposed by referring to adversarial training in Deep Learning (DL). The algorithm can converge to the optimal state quickly by self-adaptive power and probability direction of dynamic strong adversary of DAJ. In this paper, a rigorous theoretical proof of the symbol error rate is given and it is shown that the method approaches the mathematical limit. Also, numerical and hardware experiments show that the constellations generated by DAJ-RL have the best error rate at all noise levels. In the end, the proposed DAJ-RL method effectively improves the RL-based anti-jamming modulation for cognitive electronic warfare.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于动态对抗干扰的星座设计强化学习
为了抵御无线信道中的各种干扰,无线通信中使用了适当的星座调制来确保低误码率。由于信道环境的复杂性和多变性,简单的预设星座很难适应所有场景,因此基于强化学习(RL)的在线星座优化方法显示出其潜力。然而,现有的 RL 技术很难保证最佳收敛效率。因此,本文引入了动态对抗干扰(DAJ)波形,并参考深度学习(DL)中的对抗训练,提出了 DAJ-RL 方法。该算法通过DAJ动态强对抗的自适应功率和概率方向,可以快速收敛到最优状态。本文给出了符号错误率的严格理论证明,并表明该方法接近数学极限。同时,数值和硬件实验表明,DAJ-RL 生成的星座在所有噪声水平下都具有最佳误码率。最后,所提出的 DAJ-RL 方法有效地改进了认知电子战中基于 RL 的抗干扰调制。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Digital Communications and Networks
Digital Communications and Networks Computer Science-Hardware and Architecture
CiteScore
12.80
自引率
5.10%
发文量
915
审稿时长
30 weeks
期刊介绍: Digital Communications and Networks is a prestigious journal that emphasizes on communication systems and networks. We publish only top-notch original articles and authoritative reviews, which undergo rigorous peer-review. We are proud to announce that all our articles are fully Open Access and can be accessed on ScienceDirect. Our journal is recognized and indexed by eminent databases such as the Science Citation Index Expanded (SCIE) and Scopus. In addition to regular articles, we may also consider exceptional conference papers that have been significantly expanded. Furthermore, we periodically release special issues that focus on specific aspects of the field. In conclusion, Digital Communications and Networks is a leading journal that guarantees exceptional quality and accessibility for researchers and scholars in the field of communication systems and networks.
期刊最新文献
Editorial Board T2L: A traceable and trustable consortium blockchain for logistics Research and experimental validation for 3GPP ISAC channel modeling standardization DRL-based federated self-supervised learning for task offloading and resource allocation in ISAC-enabled vehicle edge computing Standardised interworking and deployment of IoT and edge computing platforms
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1