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.
翻译:蜂窝网络中无人驾驶的航空飞行器(无人驾驶飞行器)引起了相当大的兴趣,其中一项应用是飞行基地站(FBS),可以提高服务覆盖面和质量(QOS)。由于FBS是电池动力,调节其能源使用是其使用的一个重要方面;因此,在整个操作过程中,FBS的适当位置和轨迹对于克服这一挑战至关重要。在本文件中,我们提出了一个解决多FBS 3D轨迹问题的方法,其中考虑到FBS的能源消耗、运行时间、飞行距离限制和细胞间干扰限制。我们的方法分为两个阶段:FBS的部署和FBS的轨迹。在采取这一方法时,我们把问题分成几个片段。首先,我们发现FBS所需的最少数量及其适当的3D位置在每次光谱上是关键。然后,在每两个快图之间,我们提出的每个FBS的起源和目的地之间的最佳路径是利用一个拟议的线性线性问题模型,考虑FBS的能源消耗和飞行距离的轨迹。我们确定每个最短路径,然后用FBS的节路段将显示其最短路段的距离限制。我们所设定的节能。