Abstract
Over the past decades, spectral efficiency has attracted many attentions and has a mature development. However, in recent years, energy scarcity problem is more and more urgent and the concern on energy saving has received significant attentions. In the paper, we share a new light on energy saving problem of minimizing the number of active base stations (BSs) with guarantee of users' rate, and formulate the problem as an integer programming problem. We prove that the problem is NP-hard and no algorithms can obtain optimal solution in polynomial time complexity. In order to solve the problem efficiently, an iterative minimal set cover (IMSC) algorithm is proposed. The IMSC algorithm supposes all the BSs are active initially and executes a greedy algorithm iteratively to turn off part of BSs into sleep mode. Finally, we develop the simulation platform. The numerical results prove that our proposed energy saving algorithm outperforms other algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
