RIS辅助下行NOMA系统的保密和速率最大化

IF 1.6 4区 地球科学 Q3 ASTRONOMY & ASTROPHYSICS
Radio Science Pub Date : 2025-02-01 DOI:10.1029/2024RS008011
Zhitao Liu;Yongkang Peng;Youming Li;Yongfeng Du
{"title":"RIS辅助下行NOMA系统的保密和速率最大化","authors":"Zhitao Liu;Yongkang Peng;Youming Li;Yongfeng Du","doi":"10.1029/2024RS008011","DOIUrl":null,"url":null,"abstract":"In this paper, a method is proposed to improve the strongest user's channel gain and thus enhance the system secrecy sum rate (SSR) of the Non-orthogonal multiple access (NOMA) system using a reconfigurable intelligent surface (RIS). Based on the observation that the decoding process of NOMA system utilizes the power allocation differences among multiple users and the SSR largely depends on the strongest user's channel gain, an optimal power allocation optimization problem is constructed under quality of service (QoS) and total power constraints. Then a low-complexity relaxation based algorithm is proposed to improve the channel gain of the strongest user by optimizing the RIS phase, thereby enhancing the SSR of the system. The final simulation results show that the proposed method not only maintains good performance but also reduces computational complexity by about 2 dB.","PeriodicalId":49638,"journal":{"name":"Radio Science","volume":"60 2","pages":"1-8"},"PeriodicalIF":1.6000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Secrecy sum rate maximization of RIS assisted downlink NOMA system\",\"authors\":\"Zhitao Liu;Yongkang Peng;Youming Li;Yongfeng Du\",\"doi\":\"10.1029/2024RS008011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a method is proposed to improve the strongest user's channel gain and thus enhance the system secrecy sum rate (SSR) of the Non-orthogonal multiple access (NOMA) system using a reconfigurable intelligent surface (RIS). Based on the observation that the decoding process of NOMA system utilizes the power allocation differences among multiple users and the SSR largely depends on the strongest user's channel gain, an optimal power allocation optimization problem is constructed under quality of service (QoS) and total power constraints. Then a low-complexity relaxation based algorithm is proposed to improve the channel gain of the strongest user by optimizing the RIS phase, thereby enhancing the SSR of the system. The final simulation results show that the proposed method not only maintains good performance but also reduces computational complexity by about 2 dB.\",\"PeriodicalId\":49638,\"journal\":{\"name\":\"Radio Science\",\"volume\":\"60 2\",\"pages\":\"1-8\"},\"PeriodicalIF\":1.6000,\"publicationDate\":\"2025-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Radio Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10909399/\",\"RegionNum\":4,\"RegionCategory\":\"地球科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ASTRONOMY & ASTROPHYSICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Radio Science","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10909399/","RegionNum":4,"RegionCategory":"地球科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ASTRONOMY & ASTROPHYSICS","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种利用可重构智能面(RIS)提高非正交多址(NOMA)系统中最强用户信道增益从而提高系统保密和率(SSR)的方法。基于观察到NOMA系统的解码过程利用了多个用户之间的功率分配差异,而SSR在很大程度上取决于最强用户的信道增益,构造了服务质量(QoS)和总功率约束下的最优功率分配优化问题。然后提出了一种基于低复杂度松弛的算法,通过优化RIS相位来提高最强用户的信道增益,从而增强系统的SSR。最后的仿真结果表明,该方法不仅保持了良好的性能,而且将计算复杂度降低了约2 dB。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Secrecy sum rate maximization of RIS assisted downlink NOMA system
In this paper, a method is proposed to improve the strongest user's channel gain and thus enhance the system secrecy sum rate (SSR) of the Non-orthogonal multiple access (NOMA) system using a reconfigurable intelligent surface (RIS). Based on the observation that the decoding process of NOMA system utilizes the power allocation differences among multiple users and the SSR largely depends on the strongest user's channel gain, an optimal power allocation optimization problem is constructed under quality of service (QoS) and total power constraints. Then a low-complexity relaxation based algorithm is proposed to improve the channel gain of the strongest user by optimizing the RIS phase, thereby enhancing the SSR of the system. The final simulation results show that the proposed method not only maintains good performance but also reduces computational complexity by about 2 dB.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Radio Science
Radio Science 工程技术-地球化学与地球物理
CiteScore
3.30
自引率
12.50%
发文量
112
审稿时长
1 months
期刊介绍: Radio Science (RDS) publishes original scientific contributions on radio-frequency electromagnetic-propagation and its applications. Contributions covering measurement, modelling, prediction and forecasting techniques pertinent to fields and waves - including antennas, signals and systems, the terrestrial and space environment and radio propagation problems in radio astronomy - are welcome. Contributions may address propagation through, interaction with, and remote sensing of structures, geophysical media, plasmas, and materials, as well as the application of radio frequency electromagnetic techniques to remote sensing of the Earth and other bodies in the solar system.
×
引用
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学术官方微信