UAV-Aided Wireless Communication Designs With Propulsion Energy Limitations
- Authors
- Eom, Subin; Lee, Hoon; Park, Junhee; Lee, Inkyu
- Issue Date
- 1월-2020
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- UAV communication; trajectory optimization; throughput maximization; energy efficiency (EE)
- Citation
- IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, v.69, no.1, pp.651 - 662
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
- Volume
- 69
- Number
- 1
- Start Page
- 651
- End Page
- 662
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/58492
- DOI
- 10.1109/TVT.2019.2952883
- ISSN
- 0018-9545
- Abstract
- In this paper, we investigate wireless communication systems where an unmanned aerial vehicle (UAV) supports data transmissions of multiple ground nodes (GNs) while maneuvering over the operating area. The propulsion energy consumption of the UAV is taken into consideration in this system, thus the UAV should operate under the certain threshold of the velocity and the acceleration. We formulate the minimum average rate maximization problem and the energy efficiency (EE) maximization problem by jointly optimizing the trajectory, velocity, and acceleration of the UAV and the uplink transmit power at the GNs. As these problems are non-convex in general, the successive convex approximation (SCA) scheme is employed. To utilize this technique, the non-convex constraints are turned into proper convex approximations, and iterative algorithms are proposed which converge to a local optimal point. From the numerical results, it is demonstrated that the proposed algorithms outperform baseline schemes for both problems. Especially for the EE maximization problem, the proposed algorithm exhibits about 109% gain over the baseline scheme.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Electrical Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.