Abstract
This letter studies the problem of user association and scheduling in heterogeneous cellular networks under deadline constraints. The objective is to maximize the number of associated users while respecting these constraints. First, we discuss a special case of the problem and present an optimal algorithm. Second, we show that the problem is NP-hard in general and present a constant-factor approximation algorithm to solve it. Finally, we show via simulations that the proposed algorithm performs close-to-optimal and surpasses benchmark heuristic 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.
