5G and beyond (5G+) systems promise to provide better real-time services, efficient spectrum utilization, energy efficiency, and enhanced coverage. An ultra-dense small cells (SCs) network is an exceptional approach to serve these requirements; however, comes with the undesirable price ofsystem interference. Therefore, achieving a target data rate with minimal total system interference is a key research problem facing this generation. This paper utilizes the concept of associating SCs with network flying platforms (NFPs) such as unmanned balloons, drones, unmanned aerial vehicles (UAVs) . Each of these act as hubs between the core network and SCs. The association problem of SCs with NFPs is investigated while taking into consideration the following constraints: the number of NFP links, the NFP’s maximum bandwidth, whether a target data rate is maintained, etc. The goal of this work is to study the association problem of SCs with NFPs in order to achieve a minimized total interference. Two variants are discussed in this research. These are NP-hard problems that can be solved numerically using Integer Linear Programming to obtain the optimal solution. The first variant minimizes total interference while satisfying each SC data rate target and the second variant is to minimize the total interference while maintaining the system total sum rate target. We propose the bipartite matching and local search based algorithms to obtain sub-optimal solutions with reduced complexity. Integer linear programming based solution is examined to compare the performance of the proposed solutions. Simulation results show lower interference levels which approaching the derived bound with minimum total interference.

5G及更高（5G +）系统有望提供更好的实时服务，有效的频谱利用，能效和增强的覆盖范围。超密集小型小区（SC）网络是满足这些要求的一种例外方法。但是，它带来了不希望的系统干扰代价。因此，以最小的总系统干扰实现目标数据速率是这一代面临的关键研究问题。本文利用将SC与网络飞行平台（NFP）关联的概念，这些平台包括无人气球，无人机，无人飞行器（UAV）。这些中的每一个都充当核心网络和SC之间的集线器。在考虑以下约束的同时，研究了SC与NFP的关联问题：NFP链接数，NFP的最大带宽，这项工作的目的是研究SC与NFP的关联问题，以实现最小的总干扰。本研究讨论了两种变体。这些是NP难题，可以使用整数线性规划以数字方式求解以获得最佳解。第一种变形是在满足每个SC数据速率目标的同时使总干扰最小化，第二种变形是在保持系统总和率目标的同时使总干扰最小化。我们提出了基于二分匹配和局部搜索的算法来获得复杂度降低的次优解。研究了基于整数线性规划的解决方案，以比较所提出解决方案的性能。