A Distributed Power Saving Algorithm for Cellular Networks

Abstract. We consider power saving in a cellular network. Subject to constraints generated by network planning and dynamic Radio Resource Management algorithms, there is room for reducing Base Station (BS) transmit powers. We suggest that power is reduced in a way that does not move cell boundaries significantly. For this, there is a power difference constraint d max that upper limits the difference in power reductions in neighboring BSs. The BSs exchange information about their current level of power. Each BS has a target maximum power reduction. We propose a distributed algorithm, where the BSs take turns to reduce their power, respecting their neighbors current power settings and the power difference constraint. We show that this algorithm converges to a global optimum