On the Secrecy Rate of Downlink NOMA in Underlay Spectrum Sharing with Imperfect CSI: Invited Paper

Vaibhav Kumar, M. Flanagan, D. B. D. Costa, Le-Nam Tran
{"title":"On the Secrecy Rate of Downlink NOMA in Underlay Spectrum Sharing with Imperfect CSI: Invited Paper","authors":"Vaibhav Kumar, M. Flanagan, D. B. D. Costa, Le-Nam Tran","doi":"10.36227/TECHRXIV.14572548.V1","DOIUrl":null,"url":null,"abstract":"In this paper, we present the ergodic sum secrecy rate (ESSR) analysis of an underlay spectrum sharing nonorthogonal multiple access (NOMA) system. We consider the scenario where the power transmitted by the secondary transmitter (ST) is constrained by the peak tolerable interference at multiple primary receivers (PRs) as well as the maximum transmit power of the ST. The effect of channel estimation error is also taken into account in our analysis. We derive exact and asymptotic closed-form expressions for the ESSR of the downlink NOMA system, and show that the performance can be classified into two distinct regimes, i.e., it is dictated either by the interference constraint or by the power constraint. Our results confirm the superiority of the NOMA-based system over its orthogonal multiple access (OMA) based counterpart. More interestingly, our results show that NOMA helps in maintaining the secrecy rate of the strong user while significantly enhancing the secrecy performance of the weak user as compared to OMA. The correctness of the proposed investigation is corroborated through Monte Carlo simulation.","PeriodicalId":142681,"journal":{"name":"2021 28th International Conference on Telecommunications (ICT)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 28th International Conference on Telecommunications (ICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.36227/TECHRXIV.14572548.V1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In this paper, we present the ergodic sum secrecy rate (ESSR) analysis of an underlay spectrum sharing nonorthogonal multiple access (NOMA) system. We consider the scenario where the power transmitted by the secondary transmitter (ST) is constrained by the peak tolerable interference at multiple primary receivers (PRs) as well as the maximum transmit power of the ST. The effect of channel estimation error is also taken into account in our analysis. We derive exact and asymptotic closed-form expressions for the ESSR of the downlink NOMA system, and show that the performance can be classified into two distinct regimes, i.e., it is dictated either by the interference constraint or by the power constraint. Our results confirm the superiority of the NOMA-based system over its orthogonal multiple access (OMA) based counterpart. More interestingly, our results show that NOMA helps in maintaining the secrecy rate of the strong user while significantly enhancing the secrecy performance of the weak user as compared to OMA. The correctness of the proposed investigation is corroborated through Monte Carlo simulation.
基于不完全CSI的底层频谱共享下行链路NOMA保密率研究
本文给出了底层频谱共享非正交多址(NOMA)系统的遍历和保密率(ESSR)分析。我们考虑了二次发射机(ST)发射功率受多个主接收机(pr)的峰值可容忍干扰以及ST的最大发射功率限制的情况,在我们的分析中也考虑了信道估计误差的影响。本文导出了下行NOMA系统的ESSR的精确和渐近封闭表达式,并表明其性能可以分为两个不同的区域,即受干扰约束或受功率约束。我们的结果证实了基于noma的系统比基于正交多址(OMA)的系统的优越性。更有趣的是,我们的结果表明,与OMA相比,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学术官方微信