A game-theoretic approach for optimal base station sleeping in green cellular networks

This paper proposes a distributed cooperative framework to improve the energy efficiency of green cellular networks. Based on the traffic load, neighboring base stations (BSs) cooperate to optimize the BS switching (sleeping) strategies so as to maximize the energy saving while guaranteeing users´ minimal service requirements. An interaction graph is defined to capture the network impact of the BS switching operation. Then, we formulate the problem of energy saving as a constrained graphic game, where each BS acts as a game player with the constraint of traffic load. The constrained graphic game is proved to be an exact constrained potential game. Furthermore, we prove the existence of a generalized Nash equilibrium (GNE), and the best GNE coincides with the optimal solution of total energy consumption minimization. Accordingly, we design a decentralized iterative algorithm to find the best GNE (i.e., the global optimum), where only local information exchange among the neighboring BSs is needed. Simulation results finally illustrate the convergence and optimality of the proposed algorithm.