Premium
A slot‐based BS scheduling with maximum latency guarantee and capacity first in 802.16e networks
Author(s) -
Hsieh IPing,
Chang FuMin,
Kao ShangJuh
Publication year - 2012
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.1249
Subject(s) - computer science , scheduling (production processes) , computer network , wireless broadband , quality of service , base station , latency (audio) , dynamic priority scheduling , wireless network , wireless , real time computing , mathematical optimization , telecommunications , mathematics
SUMMARY The IEEE 802.16e standard specifies the QoS support at the MAC level for wireless broadband access network. To meet the QoS requirements, an efficient scheduling algorithm at base station (BS), which is not defined in the standard, is necessary for slots allocation. In this paper, a Slot‐based BS scheduling algorithm with Maximum Latency Guarantee and Capacity First (SMLG‐CF) is proposed. With SMLG‐CF, the connection request is satisfied with highest slot capacity first. Together with the use of dynamic sub‐frame adjustment, the overall system transmission can be efficiently improved. Through the finer slots calculation and accurate transmission time scheduling, the maximum latency guarantee can be better achieved for urgent requests. In the simulation, we compare the proposed mechanism with the deficit fair priority queue scheduling algorithm and the Highest Urgency First scheduling algorithm. The simulation results reveal that SMLG‐CF outperforms both algorithms from the aspect of maximum latency violation rate and average transmission rate. Copyright © 2011 John Wiley & Sons, Ltd.