Bargaining theory based RRM algorithm for OFDMA based cellular networks

The main challenge of radio resource management (RRM) schemes is how to split the transmission resources among the users of a network so that all transmission requests are satisfied in the best possible way subject to minimum complexity constraint, minimum power consumption, and efficient spectrum utilization. This multidimensional optimization is an NP-hard problem. In this paper we propose a suboptimal solution to this multidimensional optimization problem, which is based on bargaining game theory. The paper proposes also traffic dependent utility functions which take into account the QoS requirements of the associated packet stream. The results obtained by computer simulations, show that the proposed RRM algorithm brings significant improvement in terms of average delay, system capacity and bit rate values, compared to solutions presented in the technical literature at the expense of an increased complexity.