Title: A survey on design challenges of scheduling algorithms for wireless networks

Authors: Mojtaba Malekpourshahraki; Christopher Desiniotis; Marjan Radi; Behnam Dezfouli

Addresses: BITS Networked Systems Lab, Department of Computer Science, University of Illinois, Chicago, IL, USA ' Internet of Things Research Lab, Department of Computer Engineering, Santa Clara University, Santa Clara, CA, USA ' Western Digital Research, Milpitas, CA, USA ' Internet of Things Research Lab, Department of Computer Engineering, Santa Clara University, Santa Clara, CA, USA

Abstract: Recent advances in wireless technologies open up new avenues toward many newer applications; however, existing wireless networks are not efficient enough to satisfy some new applications' requirements such as low energy consumption, high throughput, and low end-to-end delay. Scheduling algorithms are promising for performance improvement by addressing the limitations of standard networking protocols. Due to the widespread deployment and applications of wireless networks, a significant number of scheduling algorithms has been proposed to improve network performance. In this paper, we provide a systematic comparison among proposed scheduling algorithm with an exhaustive, network-independent framework to easethe comparison among different scheduler design and highlight important challenges in the term of algorithmic parameters, computational order, accuracy, and overhead. We also study a set of schedulers in two main categories: low-power, and high-throughput, concerning our framework to extract the weakness and strength of each proposed method compared to other scheduling algorithms.

Keywords: scheduling algorithms; low-power wireless networks; high-throughput networks; MAC.

DOI: 10.1504/IJCNDS.2022.122167

International Journal of Communication Networks and Distributed Systems, 2022 Vol.28 No.3, pp.219 - 265

Received: 30 Dec 2020
Accepted: 06 Jul 2021
Published online: 11 Apr 2022 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article