全双工无人机基站的安全数据速率最大化

IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Digital Communications and Networks Pub Date : 2024-10-01 DOI:10.1016/j.dcan.2022.11.012
Chunlong He , Xinjie Li , Yin Huang , Jianzhen Lin , Gongbin Qian , Xingquan Li
{"title":"全双工无人机基站的安全数据速率最大化","authors":"Chunlong He ,&nbsp;Xinjie Li ,&nbsp;Yin Huang ,&nbsp;Jianzhen Lin ,&nbsp;Gongbin Qian ,&nbsp;Xingquan Li","doi":"10.1016/j.dcan.2022.11.012","DOIUrl":null,"url":null,"abstract":"<div><div>Unmanned Aerial Vehicle (UAV) is an air base station featuring flexible deployment and mobility. It can significantly improve the communication quality of the system due to its line-of-sight channel connection with ground devices. However, due to the openness of UAV-to-Ground channels, the communication between ground users’ devices and UAV is easily eavesdropped. In this paper, we aim to improve the security of communication system by using full-duplex UAV as a mobile air base station. The UAV sends interference signals to eavesdroppers and receives signals from ground devices. We jointly optimize the scheduling between the UAV and ground devices, the transmission power of the UAV and ground devices, as well as the trajectory of the UAV to maximize the minimum average security communication data rate. This optimization problem is mixed with integers and non-convex expressions. Therefore, this problem is not a standard convex optimization problem, which can not be solved with standard methods. With this in mind, we propose an effective algorithm which solves this problem iteratively by applying Successive Convex Approximation (SCA), variable relaxation and substitution. Finally, numerical results demonstrate the effectiveness of the proposed algorithm.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"10 5","pages":"Pages 1387-1393"},"PeriodicalIF":7.5000,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Secure data rate maximization for full-duplex UAV-enabled base station\",\"authors\":\"Chunlong He ,&nbsp;Xinjie Li ,&nbsp;Yin Huang ,&nbsp;Jianzhen Lin ,&nbsp;Gongbin Qian ,&nbsp;Xingquan Li\",\"doi\":\"10.1016/j.dcan.2022.11.012\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Unmanned Aerial Vehicle (UAV) is an air base station featuring flexible deployment and mobility. It can significantly improve the communication quality of the system due to its line-of-sight channel connection with ground devices. However, due to the openness of UAV-to-Ground channels, the communication between ground users’ devices and UAV is easily eavesdropped. In this paper, we aim to improve the security of communication system by using full-duplex UAV as a mobile air base station. The UAV sends interference signals to eavesdroppers and receives signals from ground devices. We jointly optimize the scheduling between the UAV and ground devices, the transmission power of the UAV and ground devices, as well as the trajectory of the UAV to maximize the minimum average security communication data rate. This optimization problem is mixed with integers and non-convex expressions. Therefore, this problem is not a standard convex optimization problem, which can not be solved with standard methods. With this in mind, we propose an effective algorithm which solves this problem iteratively by applying Successive Convex Approximation (SCA), variable relaxation and substitution. Finally, numerical results demonstrate the effectiveness of the proposed algorithm.</div></div>\",\"PeriodicalId\":48631,\"journal\":{\"name\":\"Digital Communications and Networks\",\"volume\":\"10 5\",\"pages\":\"Pages 1387-1393\"},\"PeriodicalIF\":7.5000,\"publicationDate\":\"2024-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Digital Communications and Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S235286482200253X\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"TELECOMMUNICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Digital Communications and Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S235286482200253X","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

无人飞行器(UAV)是一种空中基站,具有部署灵活、机动性强的特点。由于其与地面设备的视距信道连接,可以大大提高系统的通信质量。然而,由于无人机对地面信道的开放性,地面用户设备与无人机之间的通信很容易被窃听。本文旨在利用全双工无人机作为移动空中基站,提高通信系统的安全性。无人机向窃听者发送干扰信号,并接收来自地面设备的信号。我们共同优化无人机和地面设备之间的调度、无人机和地面设备的发射功率以及无人机的飞行轨迹,以最大限度地提高平均安全通信数据率。这个优化问题混合了整数和非凸表达式。因此,这个问题不是一个标准的凸优化问题,无法用标准方法解决。有鉴于此,我们提出了一种有效的算法,通过应用连续凸近似(SCA)、变量松弛和置换来迭代解决该问题。最后,数值结果证明了所提算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Secure data rate maximization for full-duplex UAV-enabled base station
Unmanned Aerial Vehicle (UAV) is an air base station featuring flexible deployment and mobility. It can significantly improve the communication quality of the system due to its line-of-sight channel connection with ground devices. However, due to the openness of UAV-to-Ground channels, the communication between ground users’ devices and UAV is easily eavesdropped. In this paper, we aim to improve the security of communication system by using full-duplex UAV as a mobile air base station. The UAV sends interference signals to eavesdroppers and receives signals from ground devices. We jointly optimize the scheduling between the UAV and ground devices, the transmission power of the UAV and ground devices, as well as the trajectory of the UAV to maximize the minimum average security communication data rate. This optimization problem is mixed with integers and non-convex expressions. Therefore, this problem is not a standard convex optimization problem, which can not be solved with standard methods. With this in mind, we propose an effective algorithm which solves this problem iteratively by applying Successive Convex Approximation (SCA), variable relaxation and substitution. Finally, numerical results demonstrate the effectiveness of the proposed algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Digital Communications and Networks
Digital Communications and Networks Computer Science-Hardware and Architecture
CiteScore
12.80
自引率
5.10%
发文量
915
审稿时长
30 weeks
期刊介绍: Digital Communications and Networks is a prestigious journal that emphasizes on communication systems and networks. We publish only top-notch original articles and authoritative reviews, which undergo rigorous peer-review. We are proud to announce that all our articles are fully Open Access and can be accessed on ScienceDirect. Our journal is recognized and indexed by eminent databases such as the Science Citation Index Expanded (SCIE) and Scopus. In addition to regular articles, we may also consider exceptional conference papers that have been significantly expanded. Furthermore, we periodically release special issues that focus on specific aspects of the field. In conclusion, Digital Communications and Networks is a leading journal that guarantees exceptional quality and accessibility for researchers and scholars in the field of communication systems and networks.
期刊最新文献
Editorial Board Digital twin empowered cooperative trajectory planning of platoon vehicles for collision avoidance with unexpected obstacles Information theory based clustering of cellular network usage data for the identification of representative urban areas Consistency preserving database watermarking algorithm for decision trees Digital twin empowered lightweight and efficient blockchain for dynamic internet of vehicles
×
引用
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