Max-Min Secrecy Rate for NOMA-Based UAV-Assisted Communications with Protected Zone

Zhisheng Yin, Min Jia, Wei Wang, Nan Cheng, Feng Lyu, Xuemin Shen
{"title":"Max-Min Secrecy Rate for NOMA-Based UAV-Assisted Communications with Protected Zone","authors":"Zhisheng Yin, Min Jia, Wei Wang, Nan Cheng, Feng Lyu, Xuemin Shen","doi":"10.1109/GLOBECOM38437.2019.9013815","DOIUrl":null,"url":null,"abstract":"In this paper, we study the secrecy provisioning downlink transmission in an aerial-assisted network, where the unmanned aerial vehicle (UAV) serves as an aerial platform to provide secure transmission for the mobile users (MUs) with coexist of Internet of Things (IoT) nodes (INs). Specifically, secure transmission is required for MUs to combat eavesdropping attacks and a desired successful transmission probability should be ensured for INs to receive the public instruction massages. To improve the secrecy rates (SRs) for MUs, we consider an eavesdropper-free area, i.e., protected zone, surrounding the UAV. With non-orthogonal multiple access (NOMA) for MUs, the power allocation to each MU is optimized to maximize the minimum secrecy rate of MUs within the protected zone, under the constraints of successful receiving probability requirements for INs. To solve this problem, we first prove that the max-min SR can be obtained when SRs of all users are equal, and then a dichotomy-based successive power allocation policy is proposed. Numerical results show that higher max-min secrecy rate can be achieved by our proposed power allocation policy than the traditional policy.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"16 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Global Communications Conference (GLOBECOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOBECOM38437.2019.9013815","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

In this paper, we study the secrecy provisioning downlink transmission in an aerial-assisted network, where the unmanned aerial vehicle (UAV) serves as an aerial platform to provide secure transmission for the mobile users (MUs) with coexist of Internet of Things (IoT) nodes (INs). Specifically, secure transmission is required for MUs to combat eavesdropping attacks and a desired successful transmission probability should be ensured for INs to receive the public instruction massages. To improve the secrecy rates (SRs) for MUs, we consider an eavesdropper-free area, i.e., protected zone, surrounding the UAV. With non-orthogonal multiple access (NOMA) for MUs, the power allocation to each MU is optimized to maximize the minimum secrecy rate of MUs within the protected zone, under the constraints of successful receiving probability requirements for INs. To solve this problem, we first prove that the max-min SR can be obtained when SRs of all users are equal, and then a dichotomy-based successive power allocation policy is proposed. Numerical results show that higher max-min secrecy rate can be achieved by our proposed power allocation policy than the traditional policy.
带保护区域的基于noma的无人机辅助通信的最大最小保密率
本文研究了在空中辅助网络中,无人机(UAV)作为空中平台,在物联网(IoT)节点共存的情况下,为移动用户(mu)提供安全传输的保密配置下行传输。具体来说,为了打击窃听攻击,微信号需要安全传输,并且要保证微信号接收到公开指令信息的成功传输概率。为了提高无人机的保密率(SRs),我们考虑在无人机周围设置一个无窃听者区域,即保护区。对于MU的非正交多址(NOMA),在INs成功接收概率要求的约束下,优化每个MU的功率分配,使保护区域内MU的最小保密率最大化。为了解决这一问题,我们首先证明了当所有用户的SR相等时可以得到最大最小SR,然后提出了一种基于二分类的逐次功率分配策略。数值结果表明,所提出的功率分配策略比传统的功率分配策略具有更高的最大最小保密率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信