Cargando…

Optimal UAV Deployment and Resource Management in UAV Relay Networks

UAV equipped three-dimensional (3D) wireless networks can provide a solution for the requirements of 5G communications, such as enhanced Mobile Broadband (eMBB) and massive Machine Type Communications (mMTC). Especially, the introduction of an unmanned aerial vehicle (UAV) as a relay node can improv...

Descripción completa

Detalles Bibliográficos
Autores principales: Han, Sang Ik, Baek, Jaeuk
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2021
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8539083/
https://www.ncbi.nlm.nih.gov/pubmed/34696091
http://dx.doi.org/10.3390/s21206878
Descripción
Sumario:UAV equipped three-dimensional (3D) wireless networks can provide a solution for the requirements of 5G communications, such as enhanced Mobile Broadband (eMBB) and massive Machine Type Communications (mMTC). Especially, the introduction of an unmanned aerial vehicle (UAV) as a relay node can improve the connectivity, extend the terrestrial base station (BS) coverage and enhance the throughput by taking advantage of a strong air-to-ground line of sight (LOS) channel. In this paper, we consider the deployment and resource allocation of UAV relay network (URN) to maximize the throughput of user equipment (UE) within a cell, while guaranteeing a reliable transmission to UE outside the coverage of BS. To this end, we formulate joint UAV deployment and resource allocation problems, whose analytical solutions can be hardly obtained, in general. We propose a fast and practical algorithm to provide the optimal solution for the number of transmit time slots and the UAV relay location in a sequential manner. The transmit power at BS and UAV is determined in advance based on the availability of channel state information (CSI). Simulation results demonstrate that the proposed algorithms can significantly reduce the computational effort and complexity to determine the optimal UAV location and transmit time slots over an exhaustive search.