Novel Signaling Design for MIMO-NOMA Against External and Internal Eavesdroppers

Yue Qi, M. Vaezi, W. Shin
{"title":"Novel Signaling Design for MIMO-NOMA Against External and Internal Eavesdroppers","authors":"Yue Qi, M. Vaezi, W. Shin","doi":"10.1109/iccworkshops53468.2022.9814554","DOIUrl":null,"url":null,"abstract":"Secure communication over two related multiple-input multiple-output (MIMO) non-orthogonal multiple access (NOMA) networks is investigated. Both networks consist of two legitimate (internal) users and an eavesdropper (external user). In one network, in addition to the external eavesdropper, one of the internal users is also seen as an eavesdropper to the other internal user, resulting in layered confidentiality. The secrecy capacity expressions of these networks are composed of nonconvex functions of transmit covariance matrices, which makes it intractable to find optimal transmit covariance matrices. To overcome this challenge, we form a weighted sum-rate maximization problem for each network and apply the block successive maximization method. This method updates the primal variable blocks successively by maximizing local lower-bounds of the original problem, followed by an update for the dual variable in a closed form. The solutions for these problems design covariance matrices corresponding to the transmitted messages such that they are transmitted securely and reliably. Numerical results illustrate the efficacy of the proposed signaling design for both MIMO-NOMA networks.","PeriodicalId":102261,"journal":{"name":"2022 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Communications Workshops (ICC Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iccworkshops53468.2022.9814554","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Secure communication over two related multiple-input multiple-output (MIMO) non-orthogonal multiple access (NOMA) networks is investigated. Both networks consist of two legitimate (internal) users and an eavesdropper (external user). In one network, in addition to the external eavesdropper, one of the internal users is also seen as an eavesdropper to the other internal user, resulting in layered confidentiality. The secrecy capacity expressions of these networks are composed of nonconvex functions of transmit covariance matrices, which makes it intractable to find optimal transmit covariance matrices. To overcome this challenge, we form a weighted sum-rate maximization problem for each network and apply the block successive maximization method. This method updates the primal variable blocks successively by maximizing local lower-bounds of the original problem, followed by an update for the dual variable in a closed form. The solutions for these problems design covariance matrices corresponding to the transmitted messages such that they are transmitted securely and reliably. Numerical results illustrate the efficacy of the proposed signaling design for both MIMO-NOMA networks.
MIMO-NOMA对外部和内部窃听器的新型信令设计
研究了两个相关的多输入多输出(MIMO)非正交多址(NOMA)网络的安全通信。两个网络都由两个合法(内部)用户和一个窃听者(外部用户)组成。在一个网络中,除了外部窃听者外,其中一个内部用户也被视为另一个内部用户的窃听者,从而产生分层机密性。这些网络的保密能力表达式是由传输协方差矩阵的非凸函数构成的,这使得寻找最优传输协方差矩阵变得困难。为了克服这一挑战,我们对每个网络形成一个加权和速率最大化问题,并应用块连续最大化方法。该方法通过最大化原始问题的局部下界来连续更新原始变量块,然后以封闭形式更新对偶变量。这些问题的解决方案设计了与传输消息相对应的协方差矩阵,使其安全可靠地传输。数值结果表明了所提出的MIMO-NOMA网络信令设计的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信