Using unmanned aerial vehicles (UAVs) to cover users in wireless networks has increased in recent years. Deploying UAVs in appropriate positions is important to cover users and nodes properly. In this article, we propose an efficient approach to determine the minimum number of required UAVs and their optimal positions. To this end, we use an iterative algorithm that updates the number of required UAVs at each iteration. To determine the optimal position for the UAVs, we present a mathematical model and solve it accurately after linearizing. One of the inputs of the mathematical model is a set of candidate points for UAV deployments in 2-D space. The mathematical model selects a set of points among candidate points and determines the altitude of each UAV. To provide a suitable set of candidate points, we also propose a candidate point selection method: the MergeCells method. The simulation results show that the proposed approach performs better than the 3-D P-median approach introduced in the literature. We also compare different candidate point selection approaches, and we show that the MergeCells method outperforms other methods in terms of the number of UAVs, user data rates, and simulation time.

In the Internet of Things networks deploying fixed infrastructure is not always the best and most economical solution. Advances in efficiency and durability of Unmanned Aerial Vehicles (UAV) made flying small cell base stations (BS) a promising approach by providing coverage and capacity in environments where using fixed infrastructure is not economically justified. A key challenge in covering an area with UAV-based small cell BSs is optimal positioning the UAVs to maximize the coverage and minimize the number of required UAVs. In this paper, we propose an optimization problem that helps to determine the number and position of the UAVs. Moreover, to have efficient results in a reasonable time, we propose complementary heuristic methods that effectively reduce the search space. The simulation results show that our proposed method performs better than genetic algorithms.

Unmanned aerial vehicles (UAVs) in cellular networks have garnered considerable interest. One of their applications is as flying base stations (FBSs), which can increase coverage and quality of service (QoS). Because FBSs are battery-powered, regulating their energy usage is a vital aspect of their use; and therefore the appropriate placement and trajectories of FBSs throughout their operation are critical to overcoming this challenge. In this paper, we propose a method of solving a multi-FBS 3D trajectory problem that considers FBS energy consumption, operation time, flight distance limits, and inter-cell interference constraints. Our method is divided into two phases: FBS placement and FBS trajectory. In taking this approach, we break the problem into several snapshots. First, we find the minimum number of FBSs required and their proper 3D positions in each snapshot. Then, between every two snapshots, the trajectory phase is executed. The optimal path between the origin and destination of each FBS is determined during the trajectory phase by utilizing a proposed binary linear problem (BLP) model that considers FBS energy consumption and flight distance constraints. Then, the shortest path for each FBS is determined while taking obstacles and collision avoidance into consideration. The number of FBSs needed may vary between snapshots, so we present an FBS set management (FSM) technique to manage the set of FBSs and their power. The results demonstrate that the proposed approach is applicable to real-world situations and that the outcomes are consistent with expectations.

Unmanned aerial vehicles (UAVs) have emerged as a promising technology to enhance the performance and functionality of mobile networks. UAVs can act as flying base stations, relays, or users to provide wireless services to ground users or devices. However, the optimal placement and trajectory design of UAVs in mobile networks is a challenging problem, as it involves multiple objectives, constraints, and uncertainties. In this paper, we provide a comprehensive survey of the state-of-the-art research on UAV placement and trajectory optimization in cellular networks. We first introduce the main objectives and challenges of UAV placement and trajectory optimization, such as maximizing coverage, throughput, energy efficiency, or reliability, while minimizing interference, delay, or cost. We also examine the primary models and assumptions employed for UAV placement and trajectory optimization, including channel models, mobility models, network architectures, and constraints. Additionally, we discuss the main methods and algorithms employed for UAV placement and trajectory optimization. These include optimization techniques, heuristic algorithms, machine learning approaches, and distributed solutions. Analytical results, numerical simulations, or experimental tests are further discussed as the main performance metrics and evaluation methods used for UAV placement and trajectory optimization. We also highlight the main applications and scenarios of UAV placement and trajectory optimization, such as cellular offloading, emergency communications, or aerial base stations. Finally, we identify some open problems and future research directions on UAV placement and trajectory optimization in cellular networks.

The need for continuous coverage, as well as low-latency, and ultrareliable communication in 5G and beyond cellular networks encouraged the deployment of high-altitude platforms and low-altitude drones as flying base stations (FBSs) to provide last-mile communication where high cost or geographical restrictions hinder the installation of terrestrial base stations (BSs) or during the disasters where the BSs are damaged. The performance of unmanned aerial vehicle (UAV)-assisted cellular systems in terms of coverage and quality of service offered for terrestrial users depends on the number of deployed FBSs, their 3-D location as well as trajectory. While several recent works have studied the 3-D positioning in UAV-assisted 5G networks, the problem of jointly addressing coverage and user data rate has not been addressed yet. In this article, we propose a solution for joint 3-D positioning and trajectory planning of FBSs with the objectives of the total distance between users and FBSs and minimizing the sum of FBSs flight distance by developing a fuzzy candidate points selection method.

Unmanned aerial vehicles (UAVs) in cellular networks have garnered considerable interest. One of their applications is as flying base stations (FBSs), which can increase coverage and quality of service (QoS). Because FBSs are battery-powered, regulating their energy usage is a vital aspect of their use; and therefore the appropriate placement and trajectories of FBSs throughout their operation are critical to overcoming this challenge. In this paper, we propose a method of solving a multi-FBS 3D trajectory problem that considers FBS energy consumption, operation time, flight distance limits, and inter-cell interference constraints. Our method is divided into two phases: FBS placement and FBS trajectory. In taking this approach, we break the problem into several snapshots. First, we find the minimum number of FBSs required and their proper 3D positions in each snapshot. Then, between every two snapshots, the trajectory phase is executed. The optimal path between the origin and destination of each FBS is determined during the trajectory phase by utilizing a proposed binary linear problem (BLP) model that considers FBS energy consumption and flight distance constraints. Then, the shortest path for each FBS is determined while taking obstacles and collision avoidance into consideration. The number of FBSs needed may vary between snapshots, so we present an FBS set management (FSM) technique to manage the set of FBSs and their power. The results demonstrate that the proposed approach is applicable to real-world situations and that the outcomes are consistent with expectations.