{"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 可以显著提高。
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 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.