Abstrakt

A Dynamic Uplink Scheduling Scheme For WiMAX Networks

Mr.P.S.Kumaresh , Ms.M.S.Vinodini , Dr.A.V.RamPrasad

There has been a rapid growth of new services such as online video games, video conferences and multimedia services to end users. WiMAX is an emerging technology for next generation wireless networks which supports a large number of users. To achieve Quality of Service (QoS) requirements, an efficient and reliable scheduling algorithm is needed. Among a large number of the proposed approaches in the literature, a Variably Weighted Round Robin scheduling algorithm (VWRR) has been proven to provide the best performance in an IP backbone network with no attempts on WiMAX networks. This paper proposes dynamic uplink scheduling algorithm for WiMAX networks based on VWRR to allocate the bandwidth to users to maximize the throughput and ensure the constraints of delay, jitter, and load. A comparative study between the proposed scheduling algorithm and the two most famous scheduling algorithms: Weighted Round Robin algorithm (WRR) and Modified Deficit Round Robin algorithm (MDRR) over WiMAX networks, is presented. Simulation results obtained using OPNET reveal that the proposed algorithm has a superior performance compared with WRR with respect to throughput, delay, jitter, and load. Additionally, the proposed scheduling algorithm is shown to provide an excellent level of reliability and scalability when increasing the number of served subscriber stations.