ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Lightweight Max Weight Scheduling Algorithms for Wireless Networks

Haritha, K and Singh, Chandramani (2018) Lightweight Max Weight Scheduling Algorithms for Wireless Networks. In: 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), MAY 07-11, 2018, Shanghai, PEOPLES R CHINA.

[img] PDF
Wiopt_2018.pdf - Published Version
Restricted to Registered users only

Download (164kB) | Request a copy
Official URL: https://dx.doi.org/10.23919/WIOPT.2018.8362892


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.

Item Type: Conference Proceedings
Publisher: IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Additional Information: Copyright of this article belong to IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre: Division of Electrical Sciences > Electronic Systems Engineering (Formerly Centre for Electronic Design & Technology)
Date Deposited: 05 Jul 2018 15:24
Last Modified: 05 Jul 2018 15:24
URI: http://eprints.iisc.ac.in/id/eprint/60160

Actions (login required)

View Item View Item