网络化飞行平台的小基站关联:新算法和性能界限
Small Cell Association with Networked Flying Platforms: Novel Algorithms and Performance Bounds
摘要:
第五代(5G)和超5G(B5 G)系统期望覆盖和容量增强,同时考虑有限的功率、成本和频谱。小型小区(SC)的致密化是满足5G和B5 G系统的这些需求的有前途的方法。然而,SC的这种超密集网络需要提供智能回程和前传网络。在本文中,我们采用了一个可扩展的想法,使用网络飞行平台(NFP)作为空中枢纽,提供前传连接到SC。我们考虑了SC网络中SC和NFP的关联问题,并研究了与系统和NFP相关的实际约束的影响。我们主要证明了关联问题与广义指派问题(GAP)有关。使用这种关系与GAP,我们显示了NP-困难的关联问题的复杂性,并进一步推导出最大可实现的总和数据率的上限。线性规划松弛的问题进行了研究,比较结果与导出的界限。最后,提出了关联问题的两种有效(不太复杂)的贪婪解决方案,其中一种是分布式解决方案,另一种是集中式解决方案。数值结果表明,所提出的算法的穷举搜索和导出的边界方面的良好性能。通过与穷举搜索算法的计算复杂性比较,证明了本文算法的可行性。
英文摘要:
Fifth generation (5G) and beyond-5G (B5G) systems expect coverage and capacity enhancements along with the consideration of limited power, cost and spectrum. Densification of small cells (SCs) is a promising approach to cater these demands of 5G and B5G systems. However, such an ultra dense network of SCs requires provision of smart backhaul and fronthaul networks. In this paper, we employ a scalable idea of using networked flying platforms (NFPs) as aerial hubs to provide fronthaul connectivity to the SCs. We consider the association problem of SCs and NFPs in a SC network and study the effect of practical constraints related to the system and NFPs. Mainly, we show that the association problem is related to the generalized assignment problem (GAP). Using this relation with the GAP, we show the NP-hard complexity of the association problem and further derive an upper bound for the maximum achievable sum data rate. Linear Programming relaxation of the problem is also studied to compare the results with the derived bounds. Finally, two efficient (less complex) greedy solutions of the association problem are presented, where one of them is a distributed solution and the other one is its centralized version. Numerical results show a favorable performance of the presented algorithms with respect to the exhaustive search and derived bounds. The computational complexity comparison of the algorithms with the exhaustive search is also presented to show that the presented algorithms can be practically implemented.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。