Uplink Scheduling in Multi-Cell OFDMA Networks: A Comprehensive Study

摘要

This paper proposes a comprehensive study of uplink scheduling in multi-cell OFDMA networks. We first focus on two scenarios for the homogeneous case, one without and one with a Cloud-RAN (C-RAN), and explore how to design efficient practical uplink schedulers for those scenarios. To compute the best achievable performance (BAP) under complete information, we study a centralized multi-cell scheduler. To this end, we formulate an MINLP problem and show how to solve it quasi-optimally. Then, we study the performance of an existing practical local benchmark scheduler (LBM) in terms of goodput and losses. We compare its performance to BAP and show that LBM only yields 44 percent of BAP. To reduce this performance gap, we propose two practical enhancements for LBM, one per scenario. The enhanced scheduler for the first scenario yields 51 percent of BAP (70 percent for the second). To reduce the gap further, we propose a new scheduler inspired by soft-frequency reuse (SFR). Its performance is 69 percent (resp. 83 percent) of BAP. It outperforms LBM by 56 percent for the scenario without C-RAN (84 percent with C-RAN). We finally extend our SFR-based scheduler to heterogeneous networks and show that it outperforms LBM by 53 percent for the scenario without C-RAN (96 percent with C-RAN).