UDUS Open Educational Resources

A Priority Load-Aware Scheduling Algorithm for Wireless Broadband Networks

Show simple item record

dc.contributor.author Aminu, M
dc.contributor.author Ibrahim, S
dc.contributor.author Abdulhakeem, A
dc.date.accessioned 2020-03-16T09:49:36Z
dc.date.available 2020-03-16T09:49:36Z
dc.date.issued 2018
dc.identifier.uri https://doi.org/10.1007/978-3-319-98827-6_4
dc.identifier.uri http://hdl.handle.net/123456789/897
dc.description.abstract Wireless broadband networks are emerging as reliable internet access alternatives for delivery of high speed multimedia services. WiMAX is one of such networks, designed to provide quality of service (QoS) support for different service classes with varying QoS requirements. Scheduling algorithms are required to provide such support. The existing scheduling algorithm uses dynamic weight to allocate resources based on traffic loads. However, it increases delay of real time traffics due to failure of the weight to prioritize traffics. This paper proposes a priority load aware scheduling (PLAS) algorithm to reduce delay in real time traffics. The PLAS algorithm introduces a priority value to prioritize real time traffics over non-real time traffics. The algorithm was evaluated using extensive simulations. The results show that the PLAS outperforms the existing algorithm in terms of delay en_US
dc.language.iso en en_US
dc.publisher Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering en_US
dc.subject Department of Mathematics en_US
dc.subject Department of ICT en_US
dc.title A Priority Load-Aware Scheduling Algorithm for Wireless Broadband Networks en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search UDUS-OER


Advanced Search

Browse

My Account