基于非可信无人机中继的协同NOMA网络超可靠低时延通信保障

IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Shanchao Zheng, Deying Li, Yongcai Wang, Wenping Chen
{"title":"基于非可信无人机中继的协同NOMA网络超可靠低时延通信保障","authors":"Shanchao Zheng,&nbsp;Deying Li,&nbsp;Yongcai Wang,&nbsp;Wenping Chen","doi":"10.1016/j.comnet.2025.111759","DOIUrl":null,"url":null,"abstract":"<div><div>With the advent of 5G and beyond, the requirements for latency and reliability in ultra reliability low latency communication (URLLC) have become more stringent than ever. Unlike the assumption of infinite packet length based on information theory, URLLC needs short packet transmission to achieve the stringent requirements. In this background, conventional expression of secrecy rate based on Shannon capacity achieved with infinite packet length is not applicable. Moreover, due to the openness characteristics of wireless channel, security problem is a pronounced challenge for secure URLLC. In this paper, we investigate the physical layer security (PLS) of URLLC in a cooperative non-orthogonal multiple access (NOMA) network with an untrusted unmanned aerial vehicle (UAV) relay. To enhance the PLS in the cooperative NOMA network, we propose an Effective Secrecy Throughput (EST) maximization problem which includes the joint optimization of packet length, power allocation and UAV relay trajectory. Specially, the expression of secrecy rate based on decoding error probability is utilized to construct the expression of EST. Since the EST maximum problem is nonconvex and difficult to find an optimal solution, we propose an EST optimization algorithm (ESTO) based on the block successive convex approximation (BSCA) by dividing the EST maximum problem into three subproblems: packet length optimization, power allocation optimization and UAV relay trajectory optimization. We solve the three subproblems alternately until the objective function convergences. Simulation results confirm the convergence of our proposed algorithm and demonstrate the secrecy performance of our cooperative NOMA network.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"273 ","pages":"Article 111759"},"PeriodicalIF":4.6000,"publicationDate":"2025-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Securing ultra reliability low latency communication in cooperative NOMA network with untrusted UAV relay\",\"authors\":\"Shanchao Zheng,&nbsp;Deying Li,&nbsp;Yongcai Wang,&nbsp;Wenping Chen\",\"doi\":\"10.1016/j.comnet.2025.111759\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>With the advent of 5G and beyond, the requirements for latency and reliability in ultra reliability low latency communication (URLLC) have become more stringent than ever. Unlike the assumption of infinite packet length based on information theory, URLLC needs short packet transmission to achieve the stringent requirements. In this background, conventional expression of secrecy rate based on Shannon capacity achieved with infinite packet length is not applicable. Moreover, due to the openness characteristics of wireless channel, security problem is a pronounced challenge for secure URLLC. In this paper, we investigate the physical layer security (PLS) of URLLC in a cooperative non-orthogonal multiple access (NOMA) network with an untrusted unmanned aerial vehicle (UAV) relay. To enhance the PLS in the cooperative NOMA network, we propose an Effective Secrecy Throughput (EST) maximization problem which includes the joint optimization of packet length, power allocation and UAV relay trajectory. Specially, the expression of secrecy rate based on decoding error probability is utilized to construct the expression of EST. Since the EST maximum problem is nonconvex and difficult to find an optimal solution, we propose an EST optimization algorithm (ESTO) based on the block successive convex approximation (BSCA) by dividing the EST maximum problem into three subproblems: packet length optimization, power allocation optimization and UAV relay trajectory optimization. We solve the three subproblems alternately until the objective function convergences. Simulation results confirm the convergence of our proposed algorithm and demonstrate the secrecy performance of our cooperative NOMA network.</div></div>\",\"PeriodicalId\":50637,\"journal\":{\"name\":\"Computer Networks\",\"volume\":\"273 \",\"pages\":\"Article 111759\"},\"PeriodicalIF\":4.6000,\"publicationDate\":\"2025-10-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S138912862500725X\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S138912862500725X","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

随着5G及以后时代的到来,超可靠低延迟通信(URLLC)对延迟和可靠性的要求比以往任何时候都更加严格。与信息论假设的无限数据包长度不同,URLLC需要短数据包传输来实现严格的要求。在这种背景下,传统的基于无限包长度的香农容量的保密率表达式已不适用。此外,由于无线信道的开放性,安全问题对安全URLLC是一个显著的挑战。本文研究了具有不可信无人机中继的协同非正交多址(NOMA)网络中URLLC的物理层安全性。为了提高协同NOMA网络的PLS性能,提出了一种有效保密吞吐量(EST)最大化问题,该问题包括数据包长度、功率分配和无人机中继轨迹的联合优化。特别地,利用基于译码错误概率的保密率表达式来构造EST的表达式。针对EST最大值问题非凸且难以找到最优解的特点,提出了一种基于块连续凸逼近(BSCA)的EST优化算法(ESTO),将EST最大值问题划分为数据包长度优化、功率分配优化和无人机中继轨迹优化三个子问题。我们交替求解三个子问题,直到目标函数收敛。仿真结果验证了算法的收敛性,并验证了协同NOMA网络的保密性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Securing ultra reliability low latency communication in cooperative NOMA network with untrusted UAV relay
With the advent of 5G and beyond, the requirements for latency and reliability in ultra reliability low latency communication (URLLC) have become more stringent than ever. Unlike the assumption of infinite packet length based on information theory, URLLC needs short packet transmission to achieve the stringent requirements. In this background, conventional expression of secrecy rate based on Shannon capacity achieved with infinite packet length is not applicable. Moreover, due to the openness characteristics of wireless channel, security problem is a pronounced challenge for secure URLLC. In this paper, we investigate the physical layer security (PLS) of URLLC in a cooperative non-orthogonal multiple access (NOMA) network with an untrusted unmanned aerial vehicle (UAV) relay. To enhance the PLS in the cooperative NOMA network, we propose an Effective Secrecy Throughput (EST) maximization problem which includes the joint optimization of packet length, power allocation and UAV relay trajectory. Specially, the expression of secrecy rate based on decoding error probability is utilized to construct the expression of EST. Since the EST maximum problem is nonconvex and difficult to find an optimal solution, we propose an EST optimization algorithm (ESTO) based on the block successive convex approximation (BSCA) by dividing the EST maximum problem into three subproblems: packet length optimization, power allocation optimization and UAV relay trajectory optimization. We solve the three subproblems alternately until the objective function convergences. Simulation results confirm the convergence of our proposed algorithm and demonstrate the secrecy performance of our cooperative NOMA network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
×
引用
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学术官方微信