Joint Cell Selection and Resource Allocation Games with Backhaul Constraints

TL;DR

This work proposes to model the problem of user association and resource allocation to maximize the proportional fairness of a wireless network with limited backhaul capacity as a potential game, which decreases dramatically the computational complexity and obtains a user associationand resource allocation close to the optimal solution.

Abstract

In this work we study the problem of user association and resource allocation to maximize the proportional fairness of a wireless network with limited backhaul capacity. The optimal solution of this problem requires solving a mixed integer non-linear programming problem which generally cannot be solved in real time. We propose instead to model the problem as a potential game, which decreases dramatically the computational complexity and obtains a user association and resource allocation close to the optimal solution. Additionally, the use of a game-theoretic approach allows an efficient distribution of the computational burden among the computational resources of the network.

Figures (14)

• Figure 1: Problem formulation
• Figure 2: Aggregated log-capacity for the C-Game and the U-Game with different utility functions and association policies.
• Figure 3: Aggregated capacity for the C-Game and the U-Game with different utility functions and association policies.
• Figure 4: Blocking probability for the C-Game and the U-Game with different utility functions and association policies.
• Figure 5: Jain's fairness index for the C-Game and the U-Game with different utility functions and association policies.