Improved Recursive Maximum Expansion Scheduling Algorithms for Uplink Single Carrier FDMA System

2010 ◽  
Author(s):  
Fang Liu ◽  
Xiaoming She ◽  
Lan Chen ◽  
Hiroyuki Otsuka
Keyword(s):  
Scheduling Algorithms ◽  
Maximum Expansion ◽  
Single Carrier

Capacity-Fairness Controllable Scheduling Algorithms for Single-Carrier FDMA

2014 ◽  
Vol E97.B (7) ◽  
pp. 1474-1482 ◽  
Author(s):  
Takayoshi IWATA ◽  
Hiroyuki MIYAZAKI ◽  
Fumiyuki ADACHI
Keyword(s):  
Scheduling Algorithms ◽  
Single Carrier

scholarly journals Performance Analysis of Uplink Scheduling Algorithms in LTE Networks

2018 ◽  
Vol 9 (2) ◽  
pp. 373
Author(s):  
Shafinaz Bt Ismail ◽  
Darmawaty Bt Mohd Ali ◽  
Norsuzila Ya’acob
Keyword(s):  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Base Station ◽  
System Throughput ◽  
Network Simulator ◽  
Maximum Throughput ◽  
Lte Networks ◽  
Maximum Expansion ◽  
Open Issue

Scheduling is referring to the process of allocating resources to User Equipment based on scheduling algorithms that is located at the LTE base station. Various algorithms have been proposed as the execution of scheduling algorithm, which represents an open issue in Long Term Evolution (LTE) standard. This paper makes an attempt to study and compare the performance of three well-known uplink schedulers namely, Maximum Throughput (MT), First Maximum Expansion (FME), and Round Robin (RR). The evaluation is considered for a single cell with interference for three flows such as Best effort, Video and VoIP in a pedestrian environment using the LTE-SIM network simulator. The performance evaluation is conducted in terms of system throughput, fairness index, delay and packet loss ratio (PLR). The simulations results show that RR algorithm always reaches the lowest PLR, delivering highest throughput for video and VoIP flows among all those strategies. Thus, RR is the most suitable scheduling algorithm for VoIP and video flows while MT and FME is appropriate for BE flows in LTE networks.

scholarly journals MECC scheduling algorithm in vehicular environment for uplink transmission in LTE networks

2019 ◽  
Vol 9 (2) ◽  
pp. 1191
Author(s):  
Shafinaz Ismail ◽  
Darmawaty Mohd Ali ◽  
Azita Laily Yusof
Keyword(s):  
Packet Scheduling ◽  
Scheduling Algorithm ◽  
Average Power ◽  
Proportional Fairness ◽  
Lte Networks ◽  
Maximum Expansion ◽  
Single Carrier ◽  
The Matrix ◽  
Channel Dependent ◽  
Two Stages

<span>Single Carrier Frequency Division Multiple Access (SC-FDMA) is chosen because of the lower peak-to-average power ratio (PAPR) value in uplink transmission. However, the contiguity constraint is one of the major constraint presents in uplink packet scheduling, where all RBs allocated to a single UE must be contiguous in the frequency-domain within each time slot to maintain its single carrier. This paper proposed an uplink-scheduling algorithm namely the Maximum Expansion with Contiguity Constraints (MECC) algorithm, which supports both the RT and NRT services. The MECC algorithm is deployed in two stages. In the first stage, the RBs are allocated fairly among the UEs. The second stage allocates the RBs with the highest metric value and expands the allocation on both sides of the matrix, M with respect to the contiguity constraint. The performance of the MECC algorithm was observed in terms of throughput, fairness, delay, and Packet Loss Ratio (PLR) for VoIP, video and best effort flows. The MECC scheduling algorithm is compared to other algorithms namely the Round Robin (RR), Channel-Dependent First Maximum Expansion (CD-FME), and Proportional Fairness First Maximum Expansion (PF-FME). From here, it can be concluded that the MECC algorithm shows the best results among other algorithms by delivering the highest throughput which is up to 81.29% and 90.04% than CD-FME and RR scheduler for RT and NRT traffic respectively, having low PLR and delay which is up to 93.92% and 56.22% of improvement than CD-FME for the RT traffic flow. The MECC also has a satisfactory level of fairness for the cell-edge users in a vehicular environment of LTE network.</span>

Sign in / Sign up

Export Citation Format

Share Document