arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.3773cs.NIcs.ITmath.IT
收藏

小蜂窝网络中的部分分布式资源分配

Partially-Distributed Resource Allocation in Small-Cell Networks

Sanam Sadr, Raviraj S. Adve

摘要:

针对正交频分多址(OFDMA)环境下大规模小小区网络的下行链路,提出了一种四阶段分层资源分配方案。由于干扰限制了此类网络的能力,因此资源分配和干扰管理至关重要。然而,获得全局最优的资源分配是指数复杂的并且在数学上是棘手的。在这里,我们开发了一个部分分散的算法,以获得有效的解决方案。本文的工作主要有三个优点:1)相对于固定的资源分配,我们在分配频谱时考虑了每个接入点(AP)的负载需求; 2)为了防止AP过载,我们的方案是动态的,在这个意义上,当用户从一个AP移动到另一个AP时,如果必要的话,分配的资源也是动态的,并且这样的考虑通常导致巨大的计算复杂性,这给我们带来了第三个优点:3)我们通过引入包括四个阶段的分层方案来解决复杂性:用户关联、负载估计、经由图着色的干扰管理、以及调度。我们为前三步提供数学分析,将用户和AP位置建模为泊松点过程。最后,我们提供了数值模拟的结果来说明我们的计划的有效性。

英文摘要:

We propose a four-stage hierarchical resource allocation scheme for the downlink of a large-scale small-cell network in the context of orthogonal frequency-division multiple access (OFDMA). Since interference limits the capabilities of such networks, resource allocation and interference management are crucial. However, obtaining the globally optimum resource allocation is exponentially complex and mathematically intractable. Here, we develop a partially decentralized algorithm to obtain an effective solution. The three major advantages of our work are: 1) as opposed to a fixed resource allocation, we consider load demand at each access point (AP) when allocating spectrum; 2) to prevent overloaded APs, our scheme is dynamic in the sense that as the users move from one AP to the other, so do the allocated resources, if necessary, and such considerations generally result in huge computational complexity, which brings us to the third advantage: 3) we tackle complexity by introducing a hierarchical scheme comprising four phases: user association, load estimation, interference management via graph coloring, and scheduling. We provide mathematical analysis for the first three steps modeling the user and AP locations as Poisson point processes. Finally, we provide results of numerical simulations to illustrate the efficacy of our scheme.

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

↑