Performance Analysis and Secure Resource Allocation for Relay-Aided MISO-NOMA Systems

IF 4 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Systems Journal Pub Date : 2024-09-05 DOI:10.1109/JSYST.2024.3423012
Huifang Li;Jing Li;Meng Liu;Fengkui Gong
{"title":"Performance Analysis and Secure Resource Allocation for Relay-Aided MISO-NOMA Systems","authors":"Huifang Li;Jing Li;Meng Liu;Fengkui Gong","doi":"10.1109/JSYST.2024.3423012","DOIUrl":null,"url":null,"abstract":"In this article, we investigate the physical layer security for a relay-aided multiple-input single-output (MISO) nonorthogonal multiple access (NOMA) system, where an eavesdropper tries to intercept confidential information transmission from the source and the relay by employing selection combining and maximal ratio combining, respectively. Specifically, we propose an optimal transmit antenna selection scheme to exploit the inherent spatial diversity gain for security enhancement. The closed-form expressions for the secrecy outage probability are derived to facilitate the system performance evaluation. At a more pragmatic level, we consider multiple users in the relay-aided MISO NOMA system and thus propose a user pairing algorithm to perfect successive interference cancellation. The algorithm avoids full search over all users by exploiting two-sided matching and low-complexity greed, thereby reducing the total complexity. Furthermore, aiming to maximize the secrecy rate, we formulate an optimization problem. Hence, the power allocation schemes are developed by jointly considering power limits and rate requirements. The scheme achieves closed-form solutions of power allocation for the data rate requirements of each user. Finally, simulation results validate the accuracy of the derived analysis and the improvement significant in secrecy performance by the proposed algorithm and scheme.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 3","pages":"1617-1628"},"PeriodicalIF":4.0000,"publicationDate":"2024-09-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/10666848/","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

In this article, we investigate the physical layer security for a relay-aided multiple-input single-output (MISO) nonorthogonal multiple access (NOMA) system, where an eavesdropper tries to intercept confidential information transmission from the source and the relay by employing selection combining and maximal ratio combining, respectively. Specifically, we propose an optimal transmit antenna selection scheme to exploit the inherent spatial diversity gain for security enhancement. The closed-form expressions for the secrecy outage probability are derived to facilitate the system performance evaluation. At a more pragmatic level, we consider multiple users in the relay-aided MISO NOMA system and thus propose a user pairing algorithm to perfect successive interference cancellation. The algorithm avoids full search over all users by exploiting two-sided matching and low-complexity greed, thereby reducing the total complexity. Furthermore, aiming to maximize the secrecy rate, we formulate an optimization problem. Hence, the power allocation schemes are developed by jointly considering power limits and rate requirements. The scheme achieves closed-form solutions of power allocation for the data rate requirements of each user. Finally, simulation results validate the accuracy of the derived analysis and the improvement significant in secrecy performance by the proposed algorithm and scheme.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
中继辅助 MISO-NOMA 系统的性能分析和安全资源分配
在本文中,我们研究了中继辅助多入单出(MISO)非正交多址(NOMA)系统的物理层安全性,在该系统中,窃听者试图分别采用选择组合和最大比组合来截获来自源和中继的机密信息传输。具体来说,我们提出了一种最佳发射天线选择方案,以利用固有的空间分集增益来增强安全性。为了便于系统性能评估,我们推导出了保密中断概率的闭式表达式。在更实际的层面上,我们考虑了中继辅助 MISO 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.
期刊最新文献
Relationship between emotional state and masticatory system function in a group of healthy volunteers aged 18-21. Table of Contents Front Cover Editorial IEEE Systems Council Information
×
引用
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