Premium
Throughput enhanced scheduling (TES) scheme for ultra‐dense networks
Author(s) -
Haci Huseyin,
Abdelbari Amr
Publication year - 2019
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.4229
Subject(s) - computer science , maximum throughput scheduling , scheduling (production processes) , jitter , round robin scheduling , proportionally fair , fairness measure , quality of service , network packet , fair share scheduling , dynamic priority scheduling , computer network , distributed computing , throughput , real time computing , mathematical optimization , mathematics , telecommunications , wireless
Summary This paper proposes two novel packet scheduling schemes, called as throughput enhanced scheduling (TES) and TES plus (TES+), for future ultra‐dense networks. These schemes introduce two novel parameters to the scheduling decision making and reformulate the parameters used by the state‐of‐the‐art schemes. The aim is to have a more balanced weight distribution between delay and throughput‐related parameters at scheduling decisions. Also include a new telecommunications related parameter into scheduling decision making that has not been studied by popular schedulers. The performance of novel schemes is compared with well‐known schemes—proportional fairness (PF), exponential/proportional fairness (EXP/PF), and M‐LWDF. For performance evaluation, five performance metrics—average spectral efficiency and delay, quality of service (QoS) violation ratio, jitter, and Jain's fairness index—are investigated. The simulation results show that proposed schemes can outperform all the compared scheduling schemes.