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

一种有效的Femtocell网络干扰管理策略

Efficient Interference Management Policies for Femtocell Networks

Kartik Ahuja, Yuanzhang Xiao, Mihaela van der Schaar

摘要:

管理毫微微小区下的宏小区网络中的干扰提出了一个重要但具有挑战性的问题。大多数基于空间(频率/时间)复用的方法基于对干扰图进行着色来划分用户,这被证明是次优的。一些基于空间时间复用的方法以循环(加权)轮询方式调度最大独立集(MIS),这对于延迟敏感的应用是低效的。我们提出的政策计划的MIS在一个非循环的方式,其目的是优化任何给定的网络性能标准的延迟敏感的应用程序,同时满足最低吞吐量的用户要求。重要的是,我们不采取干扰图,在现有的作品,我们提出了一个最佳的干扰图的建设。我们证明了在一定的条件下,所提出的策略实现了最优的网络性能。对于大型网络,我们提出了一个低复杂度的算法来计算所提出的政策。我们表明,计算的政策实现了一个恒定的竞争比(相对于最佳网络性能),这是独立的网络规模,在广泛的部署方案。该策略可以由用户以分散的方式实施。与现有策略相比,我们提出的策略在大规模部署中可以实现高达130%的改进。

英文摘要:

Managing interference in a network of macrocells underlaid with femtocells presents an important, yet challenging problem. A majority of spatial (frequency/time) reuse based approaches partition the users based on coloring the interference graph, which is shown to be suboptimal. Some spatial time reuse based approaches schedule the maximal independent sets (MISs) in a cyclic, (weighted) round-robin fashion, which is inefficient for delay-sensitive applications. Our proposed policies schedule the MISs in a non-cyclic fashion, which aim to optimize any given network performance criterion for delay-sensitive applications while fulfilling minimum throughput requirements of the users. Importantly, we do not take the interference graph as given as in existing works; we propose an optimal construction of the interference graph. We prove that under certain conditions, the proposed policy achieves the optimal network performance. For large networks, we propose a low-complexity algorithm for computing the proposed policy. We show that the policy computed achieves a constant competitive ratio (with respect to the optimal network performance), which is independent of the network size, under wide range of deployment scenarios. The policy can be implemented in a decentralized manner by the users. Compared to the existing policies, our proposed policies can achieve improvement of up to 130 % in large-scale deployments.

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

↑