RL-Assisted Power Allocation for Covert Communication in Distributed NOMA Networks

IF 4 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Jiaqing Bai;Ji He;Yanping Chen;Yulong Shen;Xiaohong Jiang
{"title":"RL-Assisted Power Allocation for Covert Communication in Distributed NOMA Networks","authors":"Jiaqing Bai;Ji He;Yanping Chen;Yulong Shen;Xiaohong Jiang","doi":"10.1109/JSYST.2024.3406035","DOIUrl":null,"url":null,"abstract":"This article focuses on covert communication in a distributed network with multiple nonorthogonal multiple access (NOMA) systems, where each NOMA system is consisted of a transmitter, a legitimate public user, a covert user, and a warden. Power allocation for multiple transmitters in such network is a highly tricky problem, since it needs to addresses the issues of complex inter-NOMA system interference, constraints from both public users and covert users, and the optimization of overall network performance. We first conduct a theoretical analysis to depict the inherent relationship between the inter-NOMA system interference and transmit power of transmitters. With the help of the interference analysis, we then develop a theoretical framework for the modeling of detection error probability, covert rate, and public rate in each NOMA system. Based on these results and the constraints from both public users and covert users, we formulate the concerned power allocation problem as a Markov decision process, and further develop multiagent reinforcement learning (RL) algorithms to identify the optimal power allocation among transmitters to maximize the sum-rate of the overall network. Finally, numerical results are provided to illustrate the efficiency of our RL algorithms for power allocation in multi-NOMA networks.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 3","pages":"1504-1515"},"PeriodicalIF":4.0000,"publicationDate":"2024-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Systems Journal","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10549762/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

This article focuses on covert communication in a distributed network with multiple nonorthogonal multiple access (NOMA) systems, where each NOMA system is consisted of a transmitter, a legitimate public user, a covert user, and a warden. Power allocation for multiple transmitters in such network is a highly tricky problem, since it needs to addresses the issues of complex inter-NOMA system interference, constraints from both public users and covert users, and the optimization of overall network performance. We first conduct a theoretical analysis to depict the inherent relationship between the inter-NOMA system interference and transmit power of transmitters. With the help of the interference analysis, we then develop a theoretical framework for the modeling of detection error probability, covert rate, and public rate in each NOMA system. Based on these results and the constraints from both public users and covert users, we formulate the concerned power allocation problem as a Markov decision process, and further develop multiagent reinforcement learning (RL) algorithms to identify the optimal power allocation among transmitters to maximize the sum-rate of the overall network. Finally, numerical results are provided to illustrate the efficiency of our RL algorithms for power allocation in multi-NOMA networks.
分布式 NOMA 网络中隐蔽通信的 RL 辅助功率分配
本文的重点是在具有多个非正交多址(NOMA)系统的分布式网络中进行隐蔽通信,其中每个 NOMA 系统都由一个发射机、一个合法的公共用户、一个隐蔽用户和一个管理员组成。在这种网络中,多个发射机的功率分配是一个非常棘手的问题,因为它需要解决复杂的非正交多址系统间干扰、来自公共用户和隐蔽用户的约束以及整体网络性能的优化等问题。我们首先从理论上分析了 NOMA 系统间干扰与发射机发射功率之间的内在关系。在干扰分析的帮助下,我们建立了一个理论框架,用于对每个 NOMA 系统中的检测错误概率、隐蔽率和公开率进行建模。基于这些结果以及来自公开用户和隐蔽用户的约束条件,我们将相关的功率分配问题表述为马尔可夫决策过程,并进一步开发了多代理强化学习(RL)算法,以确定发射机之间的最优功率分配,从而最大化整个网络的总速率。最后,我们提供了数值结果,以说明我们的 RL 算法在多 NOMA 网络中的功率分配效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Systems Journal
IEEE Systems Journal 工程技术-电信学
CiteScore
9.80
自引率
6.80%
发文量
572
审稿时长
4.9 months
期刊介绍: This publication provides a systems-level, focused forum for application-oriented manuscripts that address complex systems and system-of-systems of national and global significance. It intends to encourage and facilitate cooperation and interaction among IEEE Societies with systems-level and systems engineering interest, and to attract non-IEEE contributors and readers from around the globe. Our IEEE Systems Council job is to address issues in new ways that are not solvable in the domains of the existing IEEE or other societies or global organizations. These problems do not fit within traditional hierarchical boundaries. For example, disaster response such as that triggered by Hurricane Katrina, tsunamis, or current volcanic eruptions is not solvable by pure engineering solutions. We need to think about changing and enlarging the paradigm to include systems issues.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信