We present an efficient and fair scheme for allocating resources in the downlink of multiuser OFDMA cellular networks based on Nash Bargaining Solution (NBS). Although 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. The proposed algorithm satisfies the minimum rate requirement of each user first and allocates the excess subchannels by searching over the K × N subchannels to noise ratio matrix based on the bargaining process happening between the base station and the users. Hence, the complexity reduces from order O(K <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</sup> ) to O(N × K).
Read full abstract