Show simple item record

dc.contributor.authorAshfaq, Khuram
dc.contributor.authorSafdar, Ghazanfar Ali
dc.contributor.authorUr-Rehman, Masood
dc.contributor.illustrator
dc.date.accessioned2021-06-11T10:25:32Z
dc.date.available2021-05-18T00:00:00Z
dc.date.available2021-06-11T10:25:32Z
dc.date.issued2021-05-18
dc.identifier.citationAshfaq K, Safdar GA, Ur-Rehman M (2021) 'Comparative analysis of scheduling algorithms for radio resource allocation in future communication networks', PeerJ Computer Science, 7 (e546)en_US
dc.identifier.issn2376-5992
dc.identifier.pmid34084939
dc.identifier.doi10.7717/peerj-cs.546
dc.identifier.urihttp://hdl.handle.net/10547/625009
dc.description.abstractWireless links are fast becoming the key communication mode. However, as compared to the wired link, their characteristics make the traffic prone to time- and location-dependent signal attenuation, noise, fading, and interference that result in time varying channel capacities and link error rate. Scheduling algorithms play an important role in wireless links to guarantee quality of service (QoS) parameters such as throughput, delay, jitter, fairness and packet loss rate. The scheduler has vital importance in current as well as future cellular communications since it assigns resource block (RB) to different users for transmission. Scheduling algorithm makes a decision based on the information of link state, number of sessions, reserved rates and status of the session queues. The information required by a scheduler implemented in the base station can easily be collected from the downlink transmission. This paper reflects on the importance of schedulers for future wireless communications taking LTE-A networks as a case study. It compares the performance of four well-known scheduling algorithms including round robin (RR), best channel quality indicator (BCQI), proportional fair (PF), and fractional frequency reuse (FFR). The performance of these four algorithms is evaluated in terms of throughput, fairness index, spectral efficiency and overall effectiveness. System level simulations have been performed using a MATLAB based LTE-A Vienna downlink simulator. The results show that the FFR scheduler is the best performer among the four tested algorithms. It also exhibits flexibility and adaptability for radio resource assignment.en_US
dc.language.isoenen_US
dc.publisherPeerJen_US
dc.relation.urlhttps://peerj.com/articles/cs-546/en_US
dc.rightsGreen - can archive pre-print and post-print or publisher's version/PDF
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectradio resource allocationen_US
dc.subjectscheduling algorithmsen_US
dc.subjectcellular networksen_US
dc.subjectquality of serviceen_US
dc.subjectSubject Categories::G420 Networks and Communicationsen_US
dc.titleComparative analysis of scheduling algorithms for radio resource allocation in future communication networksen_US
dc.typeArticleen_US
dc.identifier.eissn2376-5992
dc.contributor.departmentUniversity of Bedfordshireen_US
dc.contributor.departmentUniversity of Glasgowen_US
dc.identifier.journalPeerJ Computer Scienceen_US
dc.identifier.pmcidPMC8157178
dc.date.updated2021-06-11T10:21:56Z
dc.description.notegold open access


Files in this item

Thumbnail
Name:
peerj-cs-546.pdf
Size:
5.358Mb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record

Green - can archive pre-print and post-print or publisher's version/PDF
Except where otherwise noted, this item's license is described as Green - can archive pre-print and post-print or publisher's version/PDF