Load Matrix Optimization in Mobile Cellular Networks

Future mobile networks providing multitude of services with large range of QoS requirements has made the importance of Radio Resource Management (RRM) ever more significant. Traditional scheduling schemes have approached resource allocation mainly from a cell point of view to large extent ignoring effects of multi-cell architecture. Recently, Load Matrix (LM) concept has been proposed which facilitates joint management of interference within and between cells for allocation of radio resources. In this paper, we assess the Load Matrix scheduling performance when combined with traditional schedulers. In addition, a new LM algorithm for efficient RRM, called Global Proportional Fair (GPF) is proposed. The results show that GPF algorithm with an appropriate window size outperforms traditional scheduling schemes in terms of both throughput and fairness. It combines the throughput advantage of Max C/I and the fairness advantage of Proportional Fair scheduler.