scholarly journals Scheduling Algorithm and Bandwidth Allocation in WiMAX

Author(s):  
Majid Taghipoor ◽  
Saeid MJafari ◽  
Vahid Hosseini
2012 ◽  
Vol 433-440 ◽  
pp. 5068-5072
Author(s):  
Lei Yan ◽  
Ho Ting Wu ◽  
Kai Wei Ke

The high transmission rate for IEEE 802.16e (WiMAX) system can afford many kinds of high quality mobile services but also induces the higher power consumption. Therefore, the IEEE 802.16e specification proposes the power saving function for MSs. However, the actual implemented sleep duration for MS is fragmentary and short. In this paper, we have proposed a complete solution of the power saving function, which includes the Call Admission Control (CAC) algorithm, the Bandwidth Allocation (BWA) algorithm, and the packet scheduling algorithm to prolong the sleep duration of MS for UGS/ertPS, rtPS, nrtPS, and BE traffics. The simulation result reveals the efficiency of sleeping mode and the excellent performances in packet delay and dropping probability.


2015 ◽  
Vol 2015 ◽  
pp. 1-9
Author(s):  
Woei-Hwa Tarn ◽  
Jenhui Chen ◽  
Chun-Liang Lee

In order to achieve higher resource utilization, the call admission control (CAC) will allow the number of connections into the system more than the system capacity can offer. However, the fairness problem will occur when these connections are real-time services. To solve this problem, in this paper, we propose a fair scheduling algorithm named contribution-based scheduling algorithm (CSA) for real-time polling service (rtPS) or guarantee bit rate (GBR) in the uplink direction in the forth-generation (4G) systems. In CSA, a mobile subscriber (MS) gains its contribution credit value at the end of each transmission time interval (TTI), which is based on the contribution of MS to the radio resource scheduling. The base station (BS) schedules the bandwidth according to the credit value. Simulation results show that CSA achieves higher fairness in bandwidth allocation while connection drop rate and queuing delay are also guaranteed as compared to the roundrobin (RR) and early deadline first (EDF) mechanisms.


2021 ◽  
Vol 8 (1) ◽  
pp. 028-038
Author(s):  
Jayanth C. ◽  
B. Sivakumar

The current basically Ethernet passive optical network (EPON) efficiently supports different service classes, i.e., Giant Prime concern (GP) traffic and Efficiently-best (EE) traffic, in future-generation networks. The difficult task is finding the efficient Dynamic Bandwidth Allocation (DBA) procedure task which suggests service classes of bandwidth simultaneously. This paper suggests improved version to DBA algorithm, Remodeled version-Hybrid division-size/Rate (HDSR) scheme. The modified control message scheduling algorithm is also discussed along with Remodeled-HDSR Algorithm which fits to the proposed scheme. In the modified Remodeled-HSSR scheme, time cycle length is identical classified accordingly with two subparts. In algorithm as explained in order to increase traffic density, the subdivision part of the planned cycle, the traffic conditions are dynamically suggested an improved version for Best effort traffic of multiple ONUs. In the First subdivision part of the span time analysis time will not be compressed, particularly at less buffer status conditions plan buffer status of the HP traffic. The Remodeled control message algorithm which predefined status and is scheduled particularly which controls connecting the sub-parts of the planned cycles of the sequence time and in-turn increases synchronization between two Gate messages to particular ONUs.


Sign in / Sign up

Export Citation Format

Share Document