Distributed Sharing Base Stations for Greening: A Population Game Approach

Abstract

Towards better QoSs and larger market share in highly competitive cellular network market, many mobile network operators (MNOs) aggressively invest in their base station (BS) deployment. As a result, BSs are densely deployed and incur a lot of energy consumptions, resulting in a large portion of operation cost. To save energy consumption, sharing BSs among different MNOs is a promising approach, where each user can be served from any BSs regardless of his or her original subscription, i.e., roaming. In this paper, we address the question of how many users should be roamed in a distributed manner with the goal of some sense of optimality. To answer this question, we take a population game approach, where we model flow-level dynamics of traffic and define an user association game among differentMNOs.We prove that the game is an exact potential game with ‘zero’-price-of-anarchy. We develop a distributed algorithm that converges the NE (which is a socially optimal point) that can be used as a light-weight, dynamic user association algorithm.