Self-Organizing Dynamic Fractional Frequency Reuse for Best-Effort Traffic through Distributed Inter-Cell Coordination

Self-optimization of the network, for the purposes of improving overall capacity and/or cell edge data rates, is an important objective for next generation cellular systems. We propose algorithms that automatically create efficient, soft fractional frequency reuse (FFR) patterns for enhancing performance of orthogonal frequency division multiple access (OFDMA) based cellular systems for forward link best effort traffic. The Multi- sector Gradient (MGR) algorithm adjusts the transmit powers of the different sub-bands by systematically pursuing maximization of the overall network utility. We show that the maximization can be done by sectors operating in a semi-autonomous way, with only some gradient information exchanged periodically by neighboring sectors. The Sector Autonomous (SA) algorithm adjusts its transmit powers in each sub-band independently in each sector using a non-trivial heuristic to achieve out- of-cell interference mitigation. This algorithm is completely autonomous and requires no exchange of information between sectors. Through extensive simulations, we demonstrate that both algorithms provide substantial performance improvements. In particular, they can improve the cell edge data throughputs significantly, by up to 66% in some cases for the MGR, while maintaining the overall sector throughput at the same level as that achieved by the traditional approach. The simulations also show that both algorithms lead the system to "self-organize" into efficient, soft FFR patterns with no a priori frequency planning.

[1]  Alexander L. Stolyar,et al.  Optimal utility based multi-user throughput allocation subject to throughput constraints , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  Thomas Bonald,et al.  Inter-cell scheduling in wireless data networks , 2004 .

[3]  Eitan Altman,et al.  Closed Form Solutions for Symmetric Water Filling Games , 2007, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[4]  Eitan Altman,et al.  Closed form solutions for water-filling problems in optimization and game frameworks , 2007, ValueTools '07.

[5]  A. Gjendemsjo,et al.  Optimal Power Allocation and Scheduling for Two-Cell Capacity Maximization , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[6]  Alexander L. Stolyar,et al.  Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm , 2005, Queueing Syst. Theory Appl..

[7]  Harish Viswanathan,et al.  Dynamic load balancing through coordinated scheduling in packet data systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[8]  Harish Viswanathan,et al.  Self-organizing Dynamic Fractional Frequency Reuse Through Distributed Inter-cell Coordination: The Case of Best-E ort TraÆc , .

[9]  Gustavo de Veciana,et al.  Architecture and Abstractions for Environment and Traffic Aware System-Level Coordination of Wireless Networks: The Downlink Case , 2008, INFOCOM.

[10]  Harish Viswanathan,et al.  Self-Organizing Dynamic Fractional Frequency Reuse in OFDMA Systems , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[11]  S. T. Chung,et al.  A game-theoretic approach to power allocation in frequency-selective gaussian interference channels , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[12]  Alexander L. Stolyar,et al.  On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation , 2005, Oper. Res..