缓冲辅助无人机移动中继联合轨迹优化与时隙分配

Yili Liu, Ning Wang, Lingfeng Shen, Zhengyu Zhu, X. Mu
{"title":"缓冲辅助无人机移动中继联合轨迹优化与时隙分配","authors":"Yili Liu, Ning Wang, Lingfeng Shen, Zhengyu Zhu, X. Mu","doi":"10.1109/WCNCW48565.2020.9124742","DOIUrl":null,"url":null,"abstract":"Unmanned aerial vehicle (UAV) communication has been attracting increasing research interests recently. In this work, we study a buffer-aided single-UAV mobile relaying system which assists communication between a source node and a destination node on the ground. Specifically, in a slotted time system where each time slot experiences quasi-static channel condition, the buffer-aided UAV relay’s flight trajectory and the allocation of the time slots for transmission and reception are jointly optimized, subject to the information causality and UAV mobility constraints. The formulated problem is non-convex and the two sets of design variables, i.e., the trajectory position variables and the time slot allocation variables, are coupled. In order to make the problem tractable, we relax and decompose the original problem into two subproblems, i.e., the flight trajectory optimization subproblem and the time slot allocation subproblem, such that the two sets of design variables are decoupled. The two subproblems are optimized in an alternating manner until convergence to obtain solution to the joint optimization problem. Simulation results show that the proposed iterative alternating optimization algorithm is efficient and fast converging.","PeriodicalId":443582,"journal":{"name":"2020 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Joint Trajectory Optimization and Time Slot Allocation for Buffer-Aided UAV Mobile Relaying\",\"authors\":\"Yili Liu, Ning Wang, Lingfeng Shen, Zhengyu Zhu, X. Mu\",\"doi\":\"10.1109/WCNCW48565.2020.9124742\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Unmanned aerial vehicle (UAV) communication has been attracting increasing research interests recently. In this work, we study a buffer-aided single-UAV mobile relaying system which assists communication between a source node and a destination node on the ground. Specifically, in a slotted time system where each time slot experiences quasi-static channel condition, the buffer-aided UAV relay’s flight trajectory and the allocation of the time slots for transmission and reception are jointly optimized, subject to the information causality and UAV mobility constraints. The formulated problem is non-convex and the two sets of design variables, i.e., the trajectory position variables and the time slot allocation variables, are coupled. In order to make the problem tractable, we relax and decompose the original problem into two subproblems, i.e., the flight trajectory optimization subproblem and the time slot allocation subproblem, such that the two sets of design variables are decoupled. The two subproblems are optimized in an alternating manner until convergence to obtain solution to the joint optimization problem. Simulation results show that the proposed iterative alternating optimization algorithm is efficient and fast converging.\",\"PeriodicalId\":443582,\"journal\":{\"name\":\"2020 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCNCW48565.2020.9124742\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNCW48565.2020.9124742","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

近年来,无人机通信技术引起了越来越多的研究兴趣。在这项工作中,我们研究了一种缓冲辅助的单无人机移动中继系统,该系统辅助源节点和地面目标节点之间的通信。具体而言,在每个时隙都处于准静态信道状态的时隙系统中,在信息因果关系和无人机机动性约束下,联合优化缓冲辅助无人机中继的飞行轨迹和收发时隙的分配。所提出的问题是非凸的,并且两组设计变量即轨迹位置变量和时隙分配变量是耦合的。为了使问题易于处理,我们将原问题松弛分解为两个子问题,即飞行轨迹优化子问题和时隙分配子问题,使两组设计变量解耦。交替优化两个子问题,直到收敛得到联合优化问题的解。仿真结果表明,所提出的迭代交替优化算法效率高,收敛速度快。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Joint Trajectory Optimization and Time Slot Allocation for Buffer-Aided UAV Mobile Relaying
Unmanned aerial vehicle (UAV) communication has been attracting increasing research interests recently. In this work, we study a buffer-aided single-UAV mobile relaying system which assists communication between a source node and a destination node on the ground. Specifically, in a slotted time system where each time slot experiences quasi-static channel condition, the buffer-aided UAV relay’s flight trajectory and the allocation of the time slots for transmission and reception are jointly optimized, subject to the information causality and UAV mobility constraints. The formulated problem is non-convex and the two sets of design variables, i.e., the trajectory position variables and the time slot allocation variables, are coupled. In order to make the problem tractable, we relax and decompose the original problem into two subproblems, i.e., the flight trajectory optimization subproblem and the time slot allocation subproblem, such that the two sets of design variables are decoupled. The two subproblems are optimized in an alternating manner until convergence to obtain solution to the joint optimization problem. Simulation results show that the proposed iterative alternating optimization algorithm is efficient and fast converging.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信