Joint Optimization of Flight Path and Power Allocation in A UAV Relay-assisted Communication System

Lipei Liu, Rugui Yao, Ye Fan, Xiaoya Zuo, Juan Xu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Since the transmit power of the unmanned aerial vehicle (UAV) is limited, it exerts remarkable influence on the throughput of communication system. In view of this situation, this paper studies the two-hop UAV relay system, in which the UAV serves as a relay to decode and forward the information from source to destination. To maximize system throughput in the limited flight time, we jointly implement path optimization and power allocation of source/relay transmitters. For the optimization problem involved here is non-convex, we propose an efficient iterative algorithm, jointly considering the block coordinate descent method, the successive convex approximation technology, and the idea of introducing slack variables. The simulation results verify that this scheme significantly improves the system throughput compared with other two schemes where either power or path gets optimized only.

Original languageEnglish
Title of host publication32nd Wireless and Optical Communications Conference, WOCC 2023
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9798350337150
DOIs
StatePublished - 2023
Event32nd Wireless and Optical Communications Conference, WOCC 2023 - Newark, United States
Duration: 5 May 20236 May 2023

Publication series

Name32nd Wireless and Optical Communications Conference, WOCC 2023

Conference

Conference32nd Wireless and Optical Communications Conference, WOCC 2023
Country/TerritoryUnited States
CityNewark
Period5/05/236/05/23

Keywords

  • Iterative algorithm
  • path optimization
  • power allocation
  • UAV relay communication

Fingerprint

Dive into the research topics of 'Joint Optimization of Flight Path and Power Allocation in A UAV Relay-assisted Communication System'. Together they form a unique fingerprint.

Cite this