Abstract
This paper studies the base station operation and association problem for energy-efficient heterogeneous cellular networks. The objective is to find a set of base stations to activate and to associate users to base stations under minimum rate requirements. The problem is formulated as a nonconvex program and is shown to be NP-hard. Then, the problem is reduced to a base station operation problem where the association of users becomes straightforward. Based on this reduction, a brute force algorithm is developed and its complexity is discussed. To solve the problem efficiently in polynomial-time, an heuristic algorithm is proposed. Simulation results illustrate the performance of the proposed algorithm and compares it to the brute force algorithm and a benchmark algorithm.
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.
