A Dynamic Programming Approach for Base Station Sleeping in Cellular Networks

Sheng ZHOU
Zhisheng NIU

IEICE TRANSACTIONS on Communications   Vol.E95-B    No.2    pp.551-562
Publication Date: 2012/02/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E95.B.551
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Wireless Communication Technologies
base station (BS) sleeping,  blocking probability,  dynamic programming (DP),  neighboring BS cooperation,  

Full Text: PDF>>
Buy this Article

The energy consumption of the information and communication technology (ICT) industry, which has become a serious problem, is mostly due to the network infrastructure rather than the mobile terminals. In this paper, we focus on reducing the energy consumption of base stations (BSs) by adjusting their working modes (active or sleep). Specifically, the objective is to minimize the energy consumption while satisfying quality of service (QoS, e.g., blocking probability) requirement and, at the same time, avoiding frequent mode switching to reduce signaling and delay overhead. The problem is modeled as a dynamic programming (DP) problem, which is NP-hard in general. Based on cooperation among neighboring BSs, a low-complexity algorithm is proposed to reduce the size of state space as well as that of action space. Simulations demonstrate that, with the proposed algorithm, the active BS pattern well meets the time variation and the non-uniform spatial distribution of system traffic. Moreover, the tradeoff between the energy saving from BS sleeping and the cost of switching is well balanced by the proposed scheme.