Maximization of Geometric Mean of Secrecy Rates in RIS-aided Communications Networks

Ngoc-Tan Nguyen, Hongwen Yu, H. Tuan, Diep N. Nguyen, E. Dutkiewicz
{"title":"Maximization of Geometric Mean of Secrecy Rates in RIS-aided Communications Networks","authors":"Ngoc-Tan Nguyen, Hongwen Yu, H. Tuan, Diep N. Nguyen, E. Dutkiewicz","doi":"10.1109/ICCAIS56082.2022.9990481","DOIUrl":null,"url":null,"abstract":"In this paper, we study a secure communications network in which a multiple-antenna access point (AP) with the assistance of a reconfigurable intelligent surface (RIS) serves multiple single-antenna legitimate users (UEs) with the presence of an eavesdropper (EV). Specifically, the RIS, which can tune/control/alter the phase shift of reflected signals (onto it), is deployed to prevent potential information leaked (to the EV). To secure the downlinks from the AP to the UEs via the RIS, we consider the joint design of linear transmit beamformers at the AP and programmable reflecting coefficients of the RIS to maximize the geometric mean (GM) of all users’ secrecy rates. Then, an efficient algorithm, called RIS-aided secure beamforming (RaSB) algorithm, which invokes a closed-form expression at each iteration, is proposed to solve this non-convex problem. Numerical results reveal that the performance of the proposed RaSB algorithm outperforms the one without phase optimization. Simulations are also performed to investigate the impact of the EV’s position on the GM of secrecy rates.","PeriodicalId":273404,"journal":{"name":"2022 11th International Conference on Control, Automation and Information Sciences (ICCAIS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 11th International Conference on Control, Automation and Information Sciences (ICCAIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCAIS56082.2022.9990481","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we study a secure communications network in which a multiple-antenna access point (AP) with the assistance of a reconfigurable intelligent surface (RIS) serves multiple single-antenna legitimate users (UEs) with the presence of an eavesdropper (EV). Specifically, the RIS, which can tune/control/alter the phase shift of reflected signals (onto it), is deployed to prevent potential information leaked (to the EV). To secure the downlinks from the AP to the UEs via the RIS, we consider the joint design of linear transmit beamformers at the AP and programmable reflecting coefficients of the RIS to maximize the geometric mean (GM) of all users’ secrecy rates. Then, an efficient algorithm, called RIS-aided secure beamforming (RaSB) algorithm, which invokes a closed-form expression at each iteration, is proposed to solve this non-convex problem. Numerical results reveal that the performance of the proposed RaSB algorithm outperforms the one without phase optimization. Simulations are also performed to investigate the impact of the EV’s position on the GM of secrecy rates.
ris辅助通信网络中保密率几何均值的最大化
在本文中,我们研究了一种安全通信网络,其中在可重构智能表面(RIS)的帮助下,多天线接入点(AP)在窃听者(EV)存在的情况下为多个单天线合法用户(ue)服务。具体来说,RIS可以调整/控制/改变反射信号的相移,以防止潜在的信息泄露(到EV)。为了保证通过RIS从AP到ue的下行链路的安全,我们考虑在AP处联合设计线性发射波束形成器和RIS的可编程反射系数,以最大化所有用户保密率的几何平均值(GM)。然后,提出了一种有效的ris辅助安全波束形成(RaSB)算法,该算法在每次迭代时调用一个封闭形式的表达式来解决该非凸问题。数值结果表明,该算法的性能优于无相位优化算法。仿真研究了EV位置对保密率GM的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信