多用户对高能效全双工无人机中继的联合优化

IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Computer Networks Pub Date : 2024-08-22 DOI:10.1016/j.comnet.2024.110732
{"title":"多用户对高能效全双工无人机中继的联合优化","authors":"","doi":"10.1016/j.comnet.2024.110732","DOIUrl":null,"url":null,"abstract":"<div><p>This paper investigates an unmanned aerial vehicle (UAV) assisted amplify-and-forward relaying, where a full-duplex (FD) fixed-wing UAV employs a time-division multiple access scheduling protocol to provide relay services for multiple source–destination user pairs. With the aim of maximizing energy efficiency (EE) of the system, a joint optimization problem is studied so as to jointly fulfill the communication scheduling of multiple user pairs, the transmit power control and the trajectory design of the UAV. Since the optimization variables of the problem are coupled, it is non-convex and hence hard to solve directly. To this end, the initial problem is decomposed into three subproblems corresponding to the optimization of communication scheduling, and transmit power and trajectory of the UAV, respectively. The three subproblems are solved by utilizing the linear programming, the successive convex approximation (SCA), and the Dinkelbach’s algorithm. Then an iterative algorithm based on the block coordinate descent technique is proposed to tackle the joint optimization problem by optimizing the three blocks of variables alternately. Simulation results demonstrate that the proposed algorithm converges efficiently, and the EE of the joint optimization scheme can be significantly improved compared to the benchmark schemes.</p></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4000,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Joint optimization for energy efficient full-duplex UAV relaying with multiple user pairs\",\"authors\":\"\",\"doi\":\"10.1016/j.comnet.2024.110732\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper investigates an unmanned aerial vehicle (UAV) assisted amplify-and-forward relaying, where a full-duplex (FD) fixed-wing UAV employs a time-division multiple access scheduling protocol to provide relay services for multiple source–destination user pairs. With the aim of maximizing energy efficiency (EE) of the system, a joint optimization problem is studied so as to jointly fulfill the communication scheduling of multiple user pairs, the transmit power control and the trajectory design of the UAV. Since the optimization variables of the problem are coupled, it is non-convex and hence hard to solve directly. To this end, the initial problem is decomposed into three subproblems corresponding to the optimization of communication scheduling, and transmit power and trajectory of the UAV, respectively. The three subproblems are solved by utilizing the linear programming, the successive convex approximation (SCA), and the Dinkelbach’s algorithm. Then an iterative algorithm based on the block coordinate descent technique is proposed to tackle the joint optimization problem by optimizing the three blocks of variables alternately. Simulation results demonstrate that the proposed algorithm converges efficiently, and the EE of the joint optimization scheme can be significantly improved compared to the benchmark schemes.</p></div>\",\"PeriodicalId\":50637,\"journal\":{\"name\":\"Computer Networks\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2024-08-22\",\"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/S1389128624005644\",\"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/S1389128624005644","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了无人机(UAV)辅助放大-前向中继,其中全双工(FD)固定翼无人机采用时分多址调度协议为多个源-目的用户对提供中继服务。以系统能效(EE)最大化为目标,研究了一个联合优化问题,以共同完成多个用户对的通信调度、发射功率控制和无人机的轨迹设计。由于该问题的优化变量是耦合的,因此是非凸的,很难直接求解。为此,我们将初始问题分解为三个子问题,分别对应无人机的通信调度、发射功率和轨迹优化。利用线性规划、连续凸近似(SCA)和 Dinkelbach 算法解决这三个子问题。然后提出了一种基于块坐标下降技术的迭代算法,通过交替优化三个变量块来解决联合优化问题。仿真结果表明,所提出的算法收敛效率很高,与基准方案相比,联合优化方案的 EE 可以显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Joint optimization for energy efficient full-duplex UAV relaying with multiple user pairs

This paper investigates an unmanned aerial vehicle (UAV) assisted amplify-and-forward relaying, where a full-duplex (FD) fixed-wing UAV employs a time-division multiple access scheduling protocol to provide relay services for multiple source–destination user pairs. With the aim of maximizing energy efficiency (EE) of the system, a joint optimization problem is studied so as to jointly fulfill the communication scheduling of multiple user pairs, the transmit power control and the trajectory design of the UAV. Since the optimization variables of the problem are coupled, it is non-convex and hence hard to solve directly. To this end, the initial problem is decomposed into three subproblems corresponding to the optimization of communication scheduling, and transmit power and trajectory of the UAV, respectively. The three subproblems are solved by utilizing the linear programming, the successive convex approximation (SCA), and the Dinkelbach’s algorithm. Then an iterative algorithm based on the block coordinate descent technique is proposed to tackle the joint optimization problem by optimizing the three blocks of variables alternately. Simulation results demonstrate that the proposed algorithm converges efficiently, and the EE of the joint optimization scheme can be significantly improved compared to the benchmark schemes.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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.
期刊最新文献
SD-MDN-TM: A traceback and mitigation integrated mechanism against DDoS attacks with IP spoofing On the aggregation of FIBs at ICN routers using routing strategy Protecting unauthenticated messages in LTE/5G mobile networks: A two-level Hierarchical Identity-Based Signature (HIBS) solution A two-step linear programming approach for repeater placement in large-scale quantum networks Network traffic prediction based on PSO-LightGBM-TM
×
引用
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