arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.14952math.OC
收藏

空中接入点的能量有效高度Optimization

Energy Efficient Altitude Optimization of an Aerial Access Point

Nithin Babu, Konstantinos Ntougias, Constantinos B Papadias, Petar Popovski

摘要:

在本文中,我们提出了一个能量有效的最佳高度的空中接入点(AAP),它作为一个飞行的基站,以服务于一组地面用户设备(UE)。由于飞行器消耗的总能量与通信能量的比率非常大,因此我们将飞行器的能量消耗包括在问题制定中。在考虑飞行器的能量消耗模型之后,我们的目标被转化为最大化航空通信系统的全局能量效率(GEE)的非凸优化问题,受限于高度和最小个体数据速率约束。首先,采用序贯凸规划(SCP)优化技术求解非凸分式目标函数。为了比较SCP的结果与问题的全局最优值,我们将初始问题转化为单调分数最优化问题(MFP),并使用多块外近似(PA)算法求解。数值结果表明,从SCP得到的候选解与用单调分式规划技术得到的全局最优值是一致的。此外,还研究了飞行器的能量消耗对最优高度确定的影响。

英文摘要:

In this paper, we propose an energy-efficient optimal altitude for an aerial access point (AAP), which acts as a flying base station to serve a set of ground user equipment (UE). Since the ratio of total energy consumed by the aerial vehicle to the communication energy is very large, we include the aerial vehicle's energy consumption in the problem formulation. After considering the energy consumption model of the aerial vehicle, our objective is translated into a non-convex optimization problem of maximizing the global energy efficiency (GEE) of the aerial communication system, subject to altitude and minimum individual data rate constraints. At first, the non-convex fractional objective function is solved by using sequential convex programming (SCP) optimization technique. To compare the result of SCP with the global optimum of the problem, we reformulate the initial problem as a monotonic fractional optimization problem (MFP) and solve it using the polyblock outer approximation (PA) algorithm. Numerical results show that the candidate solution obtained from SCP is the same as the global optimum found using the monotonic fractional programming technique. Furthermore, the impact of the aerial vehicle's energy consumption on the optimal altitude determination is also studied.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑