| Reference : Coarse Trajectory Design for Energy Minimization in UAV-enabled Wireless Communicatio... |
| Scientific journals : Article | |||
| Engineering, computing & technology : Computer science | |||
| Computational Sciences | |||
| http://hdl.handle.net/10993/44641 | |||
| Coarse Trajectory Design for Energy Minimization in UAV-enabled Wireless Communications with Latency Constraints | |
| English | |
Tran Dinh, Hieu  [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >] | |
| Vu, Thang Xuan [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >] | |
| Chatzinotas, Symeon [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >] | |
| Shahbazpanahi, Shahram [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >] | |
| Ottersten, Björn [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >] | |
| 10-Jun-2020 | |
| IEEE Transactions on Vehicular Technology | |
| Institute of Electrical and Electronics Engineers | |
| Yes (verified by ORBilu) | |
| International | |
| 0018-9545 | |
| United States | |
| [en] dynamic programming ; energy minimization ; rotary-wing UAV ; trajectory design ; TSPTW ; UAV communication | |
| [en] In this paper, we design the UAV trajectory to
minimize the total energy consumption while satisfying the requested timeout (RT) requirement and energy budget, which is accomplished via jointly optimizing the path and UAV’s velocities along subsequent hops. The corresponding optimization problem is difficult to solve due to its non-convexity and combinatorial nature. To overcome this difficulty, we solve the original problem via two consecutive steps. Firstly, we propose two algorithms, namely heuristic search, and dynamic programming (DP) to obtain a feasible set of paths without violating the GU’s RT requirements based on the traveling salesman problem with time window (TSPTW). Then, they are compared with exhaustive search and traveling salesman problem (TSP) used as reference methods. While the exhaustive algorithm achieves the best performance at a high computation cost, the heuristic algorithm exhibits poorer performance with low complexity. As a result, the DP is proposed as a practical trade-off between the exhaustive and heuristic algorithms. Specifically, the DP algorithm results in near-optimal performance at a much lower complexity. Secondly, for given feasible paths, we propose an energy minimization problem via a joint optimization of the UAV’s velocities along subsequent hops. Finally, numerical results are presented to demonstrate the effectiveness of our proposed algorithms. The results show that the DP-based algorithm approaches the exhaustive search’s performance with a significantly reduced complexity. It is also shown that the proposed solutions outperform the state-of-theart benchmarks in terms of both energy consumption and outage performance. | |
| Interdisciplinary Centre for Security, Reliability and Trust (SnT) > SIGCOM | |
| FNR CORE ProCAST, grant C17/IS/11691338 and FNR 5G-Sky | |
| FNR CORE ProCAST, grant C17/IS/11691338 and FNR 5G-Sky | |
| Researchers ; Professionals ; Students ; General public | |
| http://hdl.handle.net/10993/44641 | |
| 10.1109/TVT.2020.3001403 | |
| FnR ; FNR11691338 > Bjorn Ottersten > ProCAST > Proactive Edge Caching for Content Delivery Networks powered by Hybrid Satellite/Terrestrial Backhauling > 01/07/2018 > 30/06/2021 > 2017 |
| File(s) associated to this reference | ||||||||||||||
|
Fulltext file(s):
| ||||||||||||||
All documents in ORBilu are protected by a user license.
