A Dynamic Resource Allocation Scheme using Nash Bargaining Game for the Uplink of Multiuser OFDM Systems

This paper proposes a dynamic resource allocation scheme based on Nash Bargaining Game (NBG) for the uplink of single-cell multiuser OFDM cellular networks. Although Nash Bargaining Solution (NBS) provides a fair and optimum approach in order to maximize the total rate of the network, there is no simple solution for the case of K users. NBS relates to maximizing the user utilities multiplication rather than the summation, hence, it makes the optimization problem harder to solve. Here, by decomposing the NBS problem into two sub-problems, the power allocation reduces to the well-known water-filling algorithm and the subchannel assignment leads to a simple algorithm which takes the total channel gain of each user as the fairness factor. Simulation results show that the proposed algorithm keeps a balance between the Max-Min approach and the Max-Sum where Max-Min aims at maximizing the worst user rate and Max-Sum maximizes the sum of the rates by blocking the users in the poor channel conditions.