Abstract
We propose a class of binary queue length information based max-weight scheduling algorithms for wireless networks. In these algorithms, the scheduler, in addition to channel states, only needs to know when a link's queue length crosses a prescribed threshold. We show that these algorithms are throughput optimal. Further, we incorporate time-since-last-service (TSLS) information to improve delay and service regularity of the scheduling algorithms while ensuring throughput optimality. We also perform simulations to illustrate throughput, delay and service regularity performance of the proposed 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.
