Analytical Optimal Joint Resource Allocation and Continuous Trajectory Design for UAV-Assisted Covert Communications

IF 10.7 1区 计算机科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Transactions on Wireless Communications Pub Date : 2024-11-11 DOI:10.1109/TWC.2024.3490898
Yuxi Huang;Yulin Hu;Xiaopeng Yuan;Anke Schmeink
{"title":"Analytical Optimal Joint Resource Allocation and Continuous Trajectory Design for UAV-Assisted Covert Communications","authors":"Yuxi Huang;Yulin Hu;Xiaopeng Yuan;Anke Schmeink","doi":"10.1109/TWC.2024.3490898","DOIUrl":null,"url":null,"abstract":"In this paper, we focus on an unmanned aerial vehicle (UAV)-assisted covert communication scenario, and introduce an optimal joint resource allocation and continuous UAV trajectory design. We aim at maximizing the information throughput between UAV and a ground user, while protecting the transmission behavior from being detected by a warden. Due to the continuity of UAV trajectory in both time and space, the formulated problem has infinitely large number of variables to be optimized, i.e., being not only cutting-edge, but also very challenging to be coped with. To address this issue, we provide an artificial potential field (APF)-based approach, with which a closed-form optimal solution is for the first time obtained for considered UAV-assisted covert communication. In particular, first based on investigation on the covertness constraint, the maximal transmit power is characterized as a closed-form binary decision function with respect to UAV position. Following the characterization, we then transform the joint optimization problem to one of pure UAV trajectory design. Subsequently, via conducting an APF to covert transmission rate between the UAV and the user, the trajectory design problem is completely equivalent to a mechanical problem, i.e., a density-variable rope shape design problem in the APF, based on mechanical equivalence technique. Such mechanical problem can be optimally solved. Specifically, the force field in the conducted APF corresponding to a covert communication is actually twisted due to the presence of the warden, for which we reorganize a brand new mechanical analysis process accordingly, including reanalyzing the direction of the force field and updating the force balance expression. Then, according to the minimum total potential energy principle, the closed-form solution of the optimal rope shape is constructed following the equilibrium analysis. In addition, acknowledging that the lowest potential point of APF changes with the covert requirement, we also discuss all the three cases for optimal trajectory distinguishing in hovering behavior of the UAV.","PeriodicalId":13431,"journal":{"name":"IEEE Transactions on Wireless Communications","volume":"24 1","pages":"213-227"},"PeriodicalIF":10.7000,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Wireless Communications","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10750259/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we focus on an unmanned aerial vehicle (UAV)-assisted covert communication scenario, and introduce an optimal joint resource allocation and continuous UAV trajectory design. We aim at maximizing the information throughput between UAV and a ground user, while protecting the transmission behavior from being detected by a warden. Due to the continuity of UAV trajectory in both time and space, the formulated problem has infinitely large number of variables to be optimized, i.e., being not only cutting-edge, but also very challenging to be coped with. To address this issue, we provide an artificial potential field (APF)-based approach, with which a closed-form optimal solution is for the first time obtained for considered UAV-assisted covert communication. In particular, first based on investigation on the covertness constraint, the maximal transmit power is characterized as a closed-form binary decision function with respect to UAV position. Following the characterization, we then transform the joint optimization problem to one of pure UAV trajectory design. Subsequently, via conducting an APF to covert transmission rate between the UAV and the user, the trajectory design problem is completely equivalent to a mechanical problem, i.e., a density-variable rope shape design problem in the APF, based on mechanical equivalence technique. Such mechanical problem can be optimally solved. Specifically, the force field in the conducted APF corresponding to a covert communication is actually twisted due to the presence of the warden, for which we reorganize a brand new mechanical analysis process accordingly, including reanalyzing the direction of the force field and updating the force balance expression. Then, according to the minimum total potential energy principle, the closed-form solution of the optimal rope shape is constructed following the equilibrium analysis. In addition, acknowledging that the lowest potential point of APF changes with the covert requirement, we also discuss all the three cases for optimal trajectory distinguishing in hovering behavior of the UAV.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
无人机辅助隐蔽通信的分析性最优联合资源分配和连续轨迹设计
本文以无人机辅助隐蔽通信场景为研究对象,提出了一种联合资源最优分配和无人机连续弹道设计方法。我们的目标是最大化无人机和地面用户之间的信息吞吐量,同时保护传输行为不被管理员发现。由于无人机轨迹在时间和空间上的连续性,所提出的问题需要优化的变量数量无限大,既具有先锋性,又极具挑战性。为了解决这个问题,我们提供了一种基于人工势场(APF)的方法,该方法首次获得了考虑的无人机辅助隐蔽通信的封闭形式最优解。特别地,首先在研究隐蔽性约束的基础上,将最大发射功率表征为与无人机位置相关的封闭式二元决策函数。在此基础上,将联合优化问题转化为单纯的无人机轨迹设计问题。随后,通过APF隐蔽无人机与用户之间的传输速率,将轨迹设计问题完全等价于一个机械问题,即基于机械等效技术的APF中变密度绳形设计问题。这样的机械问题可以得到最优解。具体来说,隐蔽通信所对应的传导APF中的力场实际上由于监狱长的存在而发生了扭曲,为此我们相应地重新组织了一个全新的力学分析过程,包括重新分析力场方向和更新力平衡表达式。然后,根据最小总势能原理,通过平衡分析,构造了最优绳形的闭型解。此外,考虑到APF的最低势能点随隐蔽要求的变化,我们还讨论了无人机悬停行为中最优轨迹识别的三种情况。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
18.60
自引率
10.60%
发文量
708
审稿时长
5.6 months
期刊介绍: The IEEE Transactions on Wireless Communications is a prestigious publication that showcases cutting-edge advancements in wireless communications. It welcomes both theoretical and practical contributions in various areas. The scope of the Transactions encompasses a wide range of topics, including modulation and coding, detection and estimation, propagation and channel characterization, and diversity techniques. The journal also emphasizes the physical and link layer communication aspects of network architectures and protocols. The journal is open to papers on specific topics or non-traditional topics related to specific application areas. This includes simulation tools and methodologies, orthogonal frequency division multiplexing, MIMO systems, and wireless over optical technologies. Overall, the IEEE Transactions on Wireless Communications serves as a platform for high-quality manuscripts that push the boundaries of wireless communications and contribute to advancements in the field.
期刊最新文献
Pinching-Antenna Systems with In-Waveguide Attenuation: Performance Analysis and Algorithm Design Hiding in Plain Sight: RIS-Aided Target Obfuscation in ISAC A Deep Learning Framework for Joint Channel Acquisition and Communication Optimization in Movable Antenna Systems MIMO Systems Aided by Microwave Linear Analog Computers: Capacity-Achieving Architectures with Reduced Circuit Complexity Beyond-Diagonal RIS Architecture Design and Optimization Under Physics-Consistent Models
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1