Energy-efficient packet scheduling algorithms for real-time communications in a mobile WiMAX system

2008 ◽  
Vol 31 (10) ◽  
pp. 2350-2359 ◽  
Author(s):  
Shiao-Li Tsao ◽  
You-Lin Chen
Author(s):  
Sofie Pollin ◽  
Bruno Bougard ◽  
Rahul Mangharam ◽  
Francky Catthoor ◽  
Ingrid Moerman ◽  
...  

2015 ◽  
Vol 61 (4) ◽  
pp. 409-414 ◽  
Author(s):  
Mohammed Mahfoudi ◽  
Moulhime El Bekkali ◽  
Abdellah Najd ◽  
M. El Ghazi ◽  
Said Mazer

Abstract The Third Generation Partnership Project (3GPP) has developed a new cellular standard based packet switching allowing high data rate, 100 Mbps in Downlink and 50 Mbps in Uplink, and having the flexibility to be used in different bandwidths ranging from 1.4 MHz up to 20 MHz, this standard is termed LTE (Long Term Evolution). Radio Resource Management (RRM) procedure is one of the key design roles for improving LTE system performance, Packet scheduling is one of the RRM mechanisms and it is responsible for radio resources allocation, However, Scheduling algorithms are not defined in 3GPP specifications. Therefore, it gets a track interests for researchers. In this paper we proposed a new LTE scheduling algorithm and we compared its performances with other well known algorithms such as Proportional Fairness (PF), Modified Largest Weighted Delay First (MLWDF), and Exponential Proportional Fairness (EXPPF) in downlink direction. The simulation results shows that the proposed scheduler satisfies the quality of service (QoS) requirements of the real-time traffic in terms of packet loss ratio (PLR), average throughput and packet delay. This paper also discusses the key issues of scheduling algorithms to be considered in future traffic requirements.


2018 ◽  
Vol 19 (4) ◽  
pp. 387-400
Author(s):  
Hussein El Ghor ◽  
Julia Hage ◽  
Nizar Hamadeh ◽  
Rafic Hage Chehade

For the past decades, we have experienced an aggressive technology scaling due to the tremendous advancements of Integrated Circuit technology. As massive integration continues, the power consumption of the IC chips exponentially increases which further degraded the system reliability. This in turn poses significant challenges to the design of real-time autonomous systems. In this paper, we target the problem of designing advanced real-time scheduling algorithms that are subject to timing, energy consumption and fault-tolerant design constraints. To this end, we first investigated the problem of developing scheduling techniques for uniprocessor real-time systems that minimizes energy consumption while still tolerating up to k transient faults to preserve the system's reliability. Two scheduling algorithms are proposed: the first scheduler is an extension of an optimal fault-free energy-efficient scheduling algorithm, named ES-DVFS. The second algorithm aims to enhance the energy saving by reserving adequate slack time for recovery when faults strike. We derive a necessary and sufficient condition that must be efficiently checked for the time and energy feasibility of aperiodic jobs in the presence of failures. Later, we formally prove that the proposed algorithm is optimal for a k-fault-tolerant model. Our simulation results demonstrate that the proposed schedulers can efficiently improve energy savings when compared with previous works.


2015 ◽  
Vol 14 (8) ◽  
pp. 6030-6040
Author(s):  
Abdallh F. Abdallh ◽  
Naif Alharbi ◽  
Kumbesan Sandrasegara

In this research paper we have implemented downlink packet scheduling algorithms in LTE-Sim simulation for LTE cellular networks. The implementation includes adding two packet scheduling algorithms (Round Robin and MaxRate). The performance of these algorithms is tested for various types of real time service (video) and non real time service(data) for fixed and mobile users at various speeds 3, and 120Km/h in LTE-Sim simulator. The simulation was setup with varying number of users 120 in fixed boundedregions of 1 km radius.The goal of this project is to study the simulation of Radio Resource Management (RRM) in 4G networks using LTE-Sim. In particular, it focuses on the comprehensive performance testing of packet scheduling algorithms (such as Max Rate, Round Robin, PF, MLWDF, EXP). The paper shows the results of implementing of these algorithms and testing their performance.


Sign in / Sign up

Export Citation Format

Share Document