Power allocation optimization for heterogeneous networks: A potential game approach

Heterogeneous deployment of base stations with different transmit power levels helps increase the network efficiency. Yet, the allocation of powers to base stations should be optimal in order to minimize interferences and thus improve users through-put. In this paper, we present a game theoretical approach to maximize the overall throughput in heterogeneous networks with optimal power allocation. We formulate the allocation problem as a "potential game". This type of games is characterized by a potential function, and has a specific property: a pure Nash equilibrium solution always exists and it is, moreover, either a local or a global optimizer of the potential function. We use a fully distributed algorithm that requires minimal coordination between base stations to reach a Nash equilibrium, and we prove that it is necessarily a global maximum. The performance of the algorithm is evaluated through simulations.