A multi-agent deep Q-learning-based joint relay and jammer selection in dual-hop wireless networks

IF 1.8 4区 计算机科学 Q3 TELECOMMUNICATIONS Annals of Telecommunications Pub Date : 2024-04-18 DOI:10.1007/s12243-024-01034-4
Anil Kumar Kamboj, Poonam Jindal, Pankaj Verma
{"title":"A multi-agent deep Q-learning-based joint relay and jammer selection in dual-hop wireless networks","authors":"Anil Kumar Kamboj, Poonam Jindal, Pankaj Verma","doi":"10.1007/s12243-024-01034-4","DOIUrl":null,"url":null,"abstract":"<p>Physical layer security (PLS) has cropped up as a promising solution to secure the wireless network. Cooperative communication is capable of improving the PLS, in addition to increasing the coverage area and reliability. It applies to diverse wireless systems, including long-term evolution (LTE) cellular systems, mobile ad hoc networks, and wireless sensor networks. The selection of relay and jammer nodes from the cluster of intermediate nodes can easily counter the strong eavesdroppers. Existing techniques of joint relay and jammer selection (JRJS) solve the optimization problem to find near-optimal secrecy. However, due to their computational complexity, most of these algorithms are not scalable for large networks. In this manuscript, we introduced the multi-agent deep Q-learning (MADQL) algorithm for secure joint relay and jammer selection in dual-hop wireless cooperative networks. The JRJS is transformed into a prediction-based problem and solved using deep Q-learning algorithms. The proposed reinforcement learning technique is model-free and best suited for situations where the exact global channel state information (CSI) for all the links is unavailable. The secrecy performance of the introduced algorithm is compared with the existing techniques. Simulation results confirmed that the MADQL-JRJS algorithm outperformed the existing algorithms.</p>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"4 1","pages":""},"PeriodicalIF":1.8000,"publicationDate":"2024-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Telecommunications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s12243-024-01034-4","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Physical layer security (PLS) has cropped up as a promising solution to secure the wireless network. Cooperative communication is capable of improving the PLS, in addition to increasing the coverage area and reliability. It applies to diverse wireless systems, including long-term evolution (LTE) cellular systems, mobile ad hoc networks, and wireless sensor networks. The selection of relay and jammer nodes from the cluster of intermediate nodes can easily counter the strong eavesdroppers. Existing techniques of joint relay and jammer selection (JRJS) solve the optimization problem to find near-optimal secrecy. However, due to their computational complexity, most of these algorithms are not scalable for large networks. In this manuscript, we introduced the multi-agent deep Q-learning (MADQL) algorithm for secure joint relay and jammer selection in dual-hop wireless cooperative networks. The JRJS is transformed into a prediction-based problem and solved using deep Q-learning algorithms. The proposed reinforcement learning technique is model-free and best suited for situations where the exact global channel state information (CSI) for all the links is unavailable. The secrecy performance of the introduced algorithm is compared with the existing techniques. Simulation results confirmed that the MADQL-JRJS algorithm outperformed the existing algorithms.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
双跳无线网络中基于多代理深度 Q 学习的联合中继和干扰器选择
物理层安全(PLS)已成为确保无线网络安全的一种有前途的解决方案。除了扩大覆盖范围和提高可靠性之外,合作通信还能改善物理层安全。它适用于各种无线系统,包括长期演进(LTE)蜂窝系统、移动 ad hoc 网络和无线传感器网络。从中间节点集群中选择中继节点和干扰节点,可以轻松对付强大的窃听者。现有的联合中继和干扰器选择(JRJS)技术可以解决优化问题,找到接近最优的保密性。然而,由于其计算复杂性,这些算法大多无法扩展到大型网络。在本手稿中,我们引入了多代理深度 Q-learning 算法(MADQL),用于双跳无线合作网络中的安全联合中继和干扰器选择。JRJS 被转化为一个基于预测的问题,并使用深度 Q-learning 算法来解决。所提出的强化学习技术不需要模型,最适用于无法获得所有链路的精确全局信道状态信息(CSI)的情况。引入算法的保密性能与现有技术进行了比较。仿真结果证实,MADQL-JRJS 算法的性能优于现有算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Annals of Telecommunications
Annals of Telecommunications 工程技术-电信学
CiteScore
5.20
自引率
5.30%
发文量
37
审稿时长
4.5 months
期刊介绍: Annals of Telecommunications is an international journal publishing original peer-reviewed papers in the field of telecommunications. It covers all the essential branches of modern telecommunications, ranging from digital communications to communication networks and the internet, to software, protocols and services, uses and economics. This large spectrum of topics accounts for the rapid convergence through telecommunications of the underlying technologies in computers, communications, content management towards the emergence of the information and knowledge society. As a consequence, the Journal provides a medium for exchanging research results and technological achievements accomplished by the European and international scientific community from academia and industry.
期刊最新文献
Editorial of 6GNet 2023 special issue On the (in)efficiency of fuzzing network protocols Investigation of LDPC codes with interleaving for 5G wireless networks Opportunistic data gathering in IoT networks using an energy-efficient data aggregation mechanism Joint MEC selection and wireless resource allocation in 5G RAN
×
引用
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