Global Proportional Fair Scheduling for Networks With Multiple Base Stations
Global Proportional Fair Scheduling for Networks With Multiple Base Stations
复制标题
DOI：
10.1109/tvt.2011.2119502
复制
发表时间：
2011-02
影响因子：
6.8
通讯作者：
Hui Zhou;Pingyi Fan;Jie Li
中科院分区：
文献类型：
--
作者：
Hui Zhou;Pingyi Fan;Jie Li
在只有一个基站为多个用户服务的单小区网络场景中，比例公平调度受到了广泛的关注和深入的研究。然而，对于一个用户可以从地理上分开的多个BS获得服务的网络，还没有做太多的工作。本文研究了在多基站多用户的无线网络中如何实现用户吞吐量的比例公平分配。提出了一种低复杂度的算法。我们证明了所提出的算法在最大化全局比例公平效用的意义下是近似最优的。此外，还提出了两种不同的实现策略来实现全局比例公平调度：一种是允许基站间通信的网络，另一种是只允许BS和用户之间传输的网络。后者的实现使算法以完全分布式的方式运行。各种仿真结果表明，新的全局公平调度方案在平均用户吞吐量、用户吞吐量振荡和公平性方面均优于单小区比例公平调度方案。低复杂度的分布式实现实现了与集中式实现几乎相同的性能。
Proportional fair scheduling has attracted much attention and has been well studied in the single-cell network scenario, where only one base station (BS) serves many users. However, for a network where one user may obtain services from multiple BSs geographically located apart, not much work has been done. In this paper, we investigate how to achieve proportional fair allocation of users' throughput in a wireless network with multiple BSs and multiple users. A low-complexity algorithm is presented. We prove that the developed algorithm is approximately optimal in the sense of maximizing a global proportional fairness utility. Furthermore, two different implementation strategies to achieve the global proportional fair scheduling are proposed: one for networks where inter-BS communications are allowed and the other for networks where only the transmissions between BSs and users are possible. The later implementation makes the algorithm operate in a totally distributed manner. Various simulations confirm that the new global fair scheduling scheme outperforms the single-cell proportional fair scheme in terms of the average user throughput, user throughput oscillation, and fairness. Low-complexity and distributed implementation achieves almost the same performance as the centralized counterpart.