论文标题
具有启用缓存和回程限制的空中基站的无线网络
Wireless Networks with Cache-Enabled and Backhaul-Limited Aerial Base Stations
论文作者
论文摘要
使用天线基站（ABS）是提高未来无线网络敏捷性和灵活性的有前途方法。 ABS可以通过向需求供应来提高网络的覆盖范围和/或能力。在网络中部署ABS提出了几个挑战，例如找到有效的ABS的3D置换，以考虑网络目标。另一个挑战是ABS的无线回程能力有限，因此可能产生的延迟较高。提出了内容缓存，以减轻回程充血并减少潜伏期。我们认为由于位置依赖性路径损失值的不同，ABS的回程能力有限，并定义了具有不同数据速率要求的两组用户（容忍和延迟敏感）。我们研究了与ABS，用户-BS关联和相应的带宽分配共同确定回程感知3D位置的问题，同时最大程度地减少了总下行链路传输功率。提出的迭代算法采用分解方法。首先，使用半明确放松和坐标下降方法发现ABS的3D位置，然后优化了用户-BS关联和带宽分配。仿真结果证明了拟议算法的有效性，并提供了有关交通分布和内容缓存对ABS发射功率和回程使用的影响的见解。
Use of aerial base stations (ABSs) is a promising approach to enhance the agility and flexibility of future wireless networks. ABSs can improve the coverage and/or capacity of a network by moving supply towards demand. Deploying ABSs in a network presents several challenges such as finding an efficient 3D-placement of ABSs that takes network objectives into account. Another challenge is the limited wireless backhaul capacity of ABSs and consequently, potentially higher latency incurred. Content caching is proposed to alleviate the backhaul congestion and decrease the latency. We consider a limited backhaul capacity for ABSs due to varying position-dependent path loss values and define two groups of users (delay-tolerant and delay-sensitive) with different data rate requirements. We study the problem of jointly determining backhaul-aware 3D placement for ABSs, user-BS associations and corresponding bandwidth allocations while minimizing total downlink transmit power. Proposed iterative algorithm applies a decomposition method. First, the 3D locations of ABSs are found using semi-definite relaxation and coordinate descent methods, and then user-BS associations and bandwidth allocations are optimized. The simulation results demonstrate the effectiveness of the proposed algorithm and provide insights about the impact of traffic distribution and content caching on transmit power and backhaul usage of ABSs.
