Premium
Real‐time multiuser scheduling based on end‐user requirement using big data analytics
Author(s) -
Chehri Abdellah,
Jeon Gwanggil
Publication year - 2018
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.5021
Subject(s) - computer science , maximum throughput scheduling , scheduling (production processes) , quality of service , computer network , wireless network , wireless , throughput , fading , distributed computing , channel (broadcasting) , round robin scheduling , fair share scheduling , telecommunications , engineering , operations management
Summary With the rapid growth in wireless data networks and increasing demand for multimedia applications, the next generation of wireless networks should be able to provide services for heterogeneous traffic with diverse quality of service (QoS) requirements. Multiuser diversity refers to a type of diversity present across different users in a fading environment. This diversity can be exploited by scheduling transmissions so that users transmit when their channel conditions are favorable. Hence, scheduling algorithms that support QoS and maintain a required throughput to ensure users' satisfaction are crucial to the development of these wireless networks. In this paper, different scheduling techniques have been evaluated using OFDM with different scenarios. The goal is to analyze the properties of networks such as throughput, fairness, and delay. Experimental results indicate that the PFS approach outperforms the other techniques in terms of fairness, throughput, and delay.