A self-optimization method for coverage-capacity optimization in OFDMA networks with MIMO

Abstract

Self-organizing networks (SON) is currently seen as a key lever to improve network performance and simplify its management. This paper considers cr-fair schedulers in an Orthogonal Frequency-Division Multiple Access (OFDMA) network. The convergence of the cr-fair scheduler is analyzed. Closed-form formulas are given for certain cases to calculate the scheduling gain, as well as a Monte-Carlo method, for a MIMO channel. A capacity-coverage algorithm based on the cr-fair schedulers using observable Key Performance Indicators (KPIs) is proposed. The algorithm is implemented in a large scale network simulator. It is shown that notable coverage gains are achieved at the expense of very small capacity losses. Copyright © 2011 ICST.