A Repeated Game Formulation of Energy-Efficient Decentralized Power Control

Abstract

International audienceDecentralized multiple access channels where each transmitter wants to selfishly maximize his transmission energy-efficiency are considered. Transmitters are assumed to choose freely their power control policy and interact (through multiuser interference) several times. It is shown that the corresponding conflict of interest can have a predictable outcome, namely a finitely or discounted repeated game equilibrium. Remarkably, it is shown that this equilibrium is Pareto-efficient under reasonable sufficient conditions and the corresponding decentralized power control policies can be implemented under realistic information assumptions: only individual channel state information and a public signal are required to implement the equilibrium strategies. Explicit equilibrium conditions are derived in terms of minimum number of game stages or maximum discount factor. Both analytical and simulation results are provided to compare the performance of the proposed power control policies with those already existing and exploiting the same information assumptions namely, those derived for the one-shot and Stackelberg games

A Survey of Energy-Efficient Techniques for 5G Networks and Challenges Ahead

“…The throughput was the first metric to be considered in the context of energy efficiency, and its use dates back to the seminal works [11], [12], and [32], in the context of CDMA networks. These studies spurred the interest for energyefficient resource allocation in wireless networks, and a throughput-based definition of energy efficiency was used in [33]- [36] proposing game-theoretic approaches for energy-efficient multiple access networks, in [37] with reference to cognitive radio systems, in [38] in conjunction with widely linear receivers, in [39] for ultrawideband systems, and in [40] for relay-based systems. -Outage capacity.…”

Distributed energy-aware resource allocation in multi-antenna multi-carrier interference networks with statistical CSI

“…Figure 2 evaluates the performance of Algorithm 1 in terms of the minimum EE, over the users, versus the number of active users. Otherwise stated, the shown performance metric is min k EE k , with EE k being the standard EE (8), achieved at the fixed point of Algorithm 1. It is to be stressed that the instantaneous EE has been plotted, meaning that once Algorithm 1 has converged, the resulting transmit powers have been used to evaluate the instantaneous achieved SINR (2) and then to compute the EE (8).…”

“…In [6], the impact of widely linear filtering on the EE of wireless networks is investigated. In [7], a hierarchical approach based on Stackelberg games is used to tackle the energy-efficient power control problem, while in [8], a power control algorithm based on a repeated-game approach is proposed. In [9], the impact of relaying on the EE of wireless networks is studied.…”

Applications of Repeated Games in Wireless Networks: A Survey

“…The authors also proposed a trigger strategy for the nodes and it is proven that the repeated game has a subgame perfect equilibrium. The proof for the existence of the equilibrium can be found in [21]. To detect any deviating player, the authors proposed the following detecting mechanism based on the public signal.…”