Abstract

The problem of user scheduling with an energy harvesting base station is considered. We study a wireless network where a set of users request to download data of certain sizes with hard deadline constraints from a base station powered exclusively by harvested energy. The objective is to maximize the number of scheduled users while respecting the deadline and energy constraints. To solve the problem, a polynomial-time algorithm is developed and proved to be optimal. In addition, when the users have common deadlines, a less complex and optimal algorithm is designed. Finally, we present simulation results to illustrate the impact of different parameters on the performance of the proposed algorithms.

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 call

Disclaimer: 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.