On Optimal Cell Activation for Coverage Preservation in Green Cellular Networks
- 11 March 2014
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 13 (11), 2580-2591
- https://doi.org/10.1109/tmc.2014.2310227
Abstract
Energy-efficient base station (BS) operation is a key design goal in green cellular networks. An effective way for energy conservation of BSs is to switch BSs on/off according to the traffic profile. However, such operations may create coverage holes in the network. In this paper, we aim to minimize the total power consumption of the network by switching BSs on/off adaptively while maintaining the network coverage. We find that the BS activation problem for minimal network power consumption with full network coverage preservation is an NP-hard problem. To address the problem, we first derive the optimal cell size for minimizing BS power consumption per unit coverage area and propose a polynomial-time algorithm for energy-efficient BS activation. The simulation results show that our algorithm can approach the minimum network power consumption and adapt to network traffic load under non-uniform traffic load distributions. More importantly, we demonstrate that network densification with small cells for bursting throughput in hot spot areas can also be beneficial in saving network energy during the low traffic load period.Keywords
This publication has 25 references indexed in Scilit:
- Energy-efficient cellular network operation via base station cooperationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2012
- Energy-Aware Network Planning for Wireless Cellular System with Inter-Cell CooperationIEEE Transactions on Wireless Communications, 2012
- Sleep mode implementation issues in green base stationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- On the capacity of log-normal fading channelsIEEE Transactions on Communications, 2009
- Optimal Downlink OFDMA Resource Allocation with Linear Complexity to Maximize Ergodic RatesIEEE Transactions on Wireless Communications, 2008
- Maintaining Sensing Coverage and Connectivity in Large Sensor NetworksPublished by Informa UK Limited ,2005
- The holes problem in wireless sensor networksACM SIGMOBILE Mobile Computing and Communications Review, 2005
- Worst and best-case coverage in sensor networksIEEE Transactions on Mobile Computing, 2005
- Approximation Algorithms for NP-Hard ProblemsACM SIGACT News, 1997
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985