An Efficient Scheduling Scheme for OFDMA Resource Blocks with Joint User Scheduling based on Earliest Deadline First with Carrier Aggregation (CA) in LTE-A System

2015 ◽  
Vol 88 (2) ◽  
pp. 173-183
Author(s):  
Ahmed A. Ali ◽  
Rosdiadee Nordin ◽  
Mahamod Ismail ◽  
Huda Abdullah
Keyword(s):  
Earliest Deadline First ◽  
Carrier Aggregation ◽  
User Scheduling ◽  
Scheduling Scheme ◽  
Earliest Deadline

scholarly journals Impact of Feedback Channel Delay over Joint User Scheduling Scheme and Separated Random User Scheduling Scheme in LTE-A System with Carrier Aggregation

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Ahmed A. Ali ◽  
Rosdiadee Nordin ◽  
Mahamod Ismail ◽  
Huda Abdullah
Keyword(s):  
Base Station ◽  
Wireless Channel ◽  
Main Beam ◽  
Carrier Aggregation ◽  
User Scheduling ◽  
Current Channel ◽  
Scheduling Scheme ◽  
Channel Quality ◽  
Measurement Results ◽  
The Impact

In Long Term Evolution-Advanced (LTE-A), the signal quality in a wireless channel is estimated based on the channel quality measurements. The measurement results are used to select suitable modulation and coding scheme for each transmission, feedback, and processing delay, which can cause a mismatch between channel quality information (CQI) and current channel state at the base station. However, prospect delays in the reception of such CQI may lead to a system performance degradation. This study analyzes the impact of CQI feedback delay on joint user scheduling (JUS) scheme and separated random user scheduling (SRUS) scheme in LTE-A system over carrier aggregation. The analysis will be compared with the system having delayed channel and perfect knowledge at different deployment scenario. We will study the throughput performance of both scheduling schemes with different deployment scenario, and then recommend the suitable deployment scenario to keep the desired QoS for a specific number of users. Results show that, in main beam directed at sector boundaries and diverse coverage, JUS scheme performs better than SRUS, which can justify the intensive use of user equipment power and extra control signaling overhead.

scholarly journals Buffer minimization in earliest-deadline first scheduling of dataflow graphs

2013 ◽  
Vol 48 (5) ◽  
pp. 133-142 ◽  
Author(s):  
Adnan Bouakaz ◽  
Jean-Pierre Talpin
Keyword(s):  
Earliest Deadline First ◽  
Dataflow Graphs ◽  
Earliest Deadline ◽  
Buffer Minimization

The Global Limited Preemptive Earliest Deadline First Feasibility of Sporadic Real-Time Tasks

2014 ◽  
Author(s):  
Abhilash Thekkilakattil ◽  
Sanjoy Baruah ◽  
Radu Dobrin ◽  
Sasikumar Punnekkat
Keyword(s):  
Real Time ◽  
Earliest Deadline First ◽  
Earliest Deadline
Sign in / Sign up

Export Citation Format

Share Document