Samia Dardouri - Academia.edu (original) (raw)

Papers by Samia Dardouri

Research paper thumbnail of Resource allocation using Nucleolus Value in downlink LTE networks

2016 IEEE Symposium on Computers and Communication (ISCC), 2016

The QoS (Quality of Service) requirements of real time (RT) applications are within the most impo... more The QoS (Quality of Service) requirements of real time (RT) applications are within the most important challenges that LTE (Long Term Evolution) must provide. However, due to the limited radio resources, it is important to take advantage of these resources efficiently. User traffic can be classified into two main classes which are RT (Real Time) and NRT traffic. To respond to RTs QoS requirements, resource allocation steps must be as optimal as possible. This paper proposes a scheduling algorithm in two levels based on cooperative game theory, aiming at improving performance and justice in the distribution of radio resources. Simulations demonstrate that the proposed algorithm improve the level of the system's QoS more effectively than other algorithms under the circumstance that guarantees users minimum QoS requirement.

Research paper thumbnail of Comparative Study of Scheduling Algorithms for LTE Networks

Scheduling is the process of dynamically allocating physical resources to User Equipment (UE) bas... more Scheduling is the process of dynamically allocating physical resources to User Equipment (UE) based on scheduling algorithms implemented at the LTE base station. Various algorithms have been proposed by network researchers as the implementation 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 PF, MLWDF and EXP/PF scheduling algorithms. The evaluation is considered for a single cell with interference scenario for different flows such as Best effort, Video and VoIP in a pedestrian and vehicular environment using the LTE-Sim network simulator. The comparative study is conducted in terms of system throughput, fairness index, delay, packet loss ratio (PLR) and total cell spectral efficiency.

Research paper thumbnail of Performance Analysis of Resource Scheduling in LTE Femtocells Networks

Computer Science & Information Technology ( CS & IT ), 2014

3GPP has introduced LTE Femtocells to manipulate the traffic for indoor users and to minimize the... more 3GPP has introduced LTE Femtocells to manipulate the traffic for indoor users and to minimize the charge on the Macro cells. A key mechanism in the LTE traffic handling is the packet scheduler which is in charge of allocating resources to active flows in both the frequency and time dimension. So several scheduling algorithms need to be analyzed for femtocells networks. In this paper we introduce a performance analysis of three distinct scheduling algorithms of mixed type of traffic flows in LTE femtocells networks. The particularly study is evaluated in terms of throughput, packet loss ratio, fairness index and spectral efficiency.

Research paper thumbnail of Comparative Study of Downlink Packet Scheduling for LTE Networks

Wireless Personal Communications, 2015

Scheduling is the method of dynamically allocating radio resources to user equipment based on sch... more Scheduling is the method of dynamically allocating radio resources to user equipment based on scheduling algorithms involved in the long term evolution (LTE) base station. Several algorithms have been proposed by network researchers as the realization of scheduling algorithm which explains an open issue in LTE standard to be able to meet the quality of service requirements for different applications. In this paper, we evaluate the performance of six scheduling algorithms suggested for LTE downlink transmission. The analysis is inspected for a multicellular with interference scenario for real-time and non-real-time traffic.

Research paper thumbnail of Modeling and Performance Evaluation of Packet Scheduling in Uplink 3GPP Lte Systems

JOURNAL OF MECHANICS OF CONTINUA AND MATHEMATICAL SCIENCES

Research paper thumbnail of Comparative Study of Scheduling Algorithms for Real Time Environment

International Journal of Computer Applications, 2012

Scheduling is a technique which makes an arrangement of performing certain tasks at specified per... more Scheduling is a technique which makes an arrangement of performing certain tasks at specified period. The intervals between each function have been clearly defined by the algorithm to avoid any overlapping. The real time computing systems are those in which there are strict timing constraints that have to be met to get the correct output i.e. the output not only depend on the correctness of the outcome but also on the time at which results are produced. Real time systems are expected to change its state in real time even after the controlling processor has stopped its execution. The bound in which real time applications are needed to respond to the stimuli is known as deadline. In order to achieve optimized results in a real rime operations the scheduling techniques has been used. In the paper we classify the various scheduling techniques based on different parameters. Also techniques used for scheduling in real time environment are analyzed and comparison between different techniques have been done. The various issues have been presented on which there is still a need to work.

Research paper thumbnail of Resource allocation using Nucleolus Value in downlink LTE networks

2016 IEEE Symposium on Computers and Communication (ISCC), 2016

The QoS (Quality of Service) requirements of real time (RT) applications are within the most impo... more The QoS (Quality of Service) requirements of real time (RT) applications are within the most important challenges that LTE (Long Term Evolution) must provide. However, due to the limited radio resources, it is important to take advantage of these resources efficiently. User traffic can be classified into two main classes which are RT (Real Time) and NRT traffic. To respond to RTs QoS requirements, resource allocation steps must be as optimal as possible. This paper proposes a scheduling algorithm in two levels based on cooperative game theory, aiming at improving performance and justice in the distribution of radio resources. Simulations demonstrate that the proposed algorithm improve the level of the system's QoS more effectively than other algorithms under the circumstance that guarantees users minimum QoS requirement.

Research paper thumbnail of Comparative Study of Scheduling Algorithms for LTE Networks

Scheduling is the process of dynamically allocating physical resources to User Equipment (UE) bas... more Scheduling is the process of dynamically allocating physical resources to User Equipment (UE) based on scheduling algorithms implemented at the LTE base station. Various algorithms have been proposed by network researchers as the implementation 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 PF, MLWDF and EXP/PF scheduling algorithms. The evaluation is considered for a single cell with interference scenario for different flows such as Best effort, Video and VoIP in a pedestrian and vehicular environment using the LTE-Sim network simulator. The comparative study is conducted in terms of system throughput, fairness index, delay, packet loss ratio (PLR) and total cell spectral efficiency.

Research paper thumbnail of Performance Analysis of Resource Scheduling in LTE Femtocells Networks

Computer Science & Information Technology ( CS & IT ), 2014

3GPP has introduced LTE Femtocells to manipulate the traffic for indoor users and to minimize the... more 3GPP has introduced LTE Femtocells to manipulate the traffic for indoor users and to minimize the charge on the Macro cells. A key mechanism in the LTE traffic handling is the packet scheduler which is in charge of allocating resources to active flows in both the frequency and time dimension. So several scheduling algorithms need to be analyzed for femtocells networks. In this paper we introduce a performance analysis of three distinct scheduling algorithms of mixed type of traffic flows in LTE femtocells networks. The particularly study is evaluated in terms of throughput, packet loss ratio, fairness index and spectral efficiency.

Research paper thumbnail of Comparative Study of Downlink Packet Scheduling for LTE Networks

Wireless Personal Communications, 2015

Scheduling is the method of dynamically allocating radio resources to user equipment based on sch... more Scheduling is the method of dynamically allocating radio resources to user equipment based on scheduling algorithms involved in the long term evolution (LTE) base station. Several algorithms have been proposed by network researchers as the realization of scheduling algorithm which explains an open issue in LTE standard to be able to meet the quality of service requirements for different applications. In this paper, we evaluate the performance of six scheduling algorithms suggested for LTE downlink transmission. The analysis is inspected for a multicellular with interference scenario for real-time and non-real-time traffic.

Research paper thumbnail of Modeling and Performance Evaluation of Packet Scheduling in Uplink 3GPP Lte Systems

JOURNAL OF MECHANICS OF CONTINUA AND MATHEMATICAL SCIENCES

Research paper thumbnail of Comparative Study of Scheduling Algorithms for Real Time Environment

International Journal of Computer Applications, 2012

Scheduling is a technique which makes an arrangement of performing certain tasks at specified per... more Scheduling is a technique which makes an arrangement of performing certain tasks at specified period. The intervals between each function have been clearly defined by the algorithm to avoid any overlapping. The real time computing systems are those in which there are strict timing constraints that have to be met to get the correct output i.e. the output not only depend on the correctness of the outcome but also on the time at which results are produced. Real time systems are expected to change its state in real time even after the controlling processor has stopped its execution. The bound in which real time applications are needed to respond to the stimuli is known as deadline. In order to achieve optimized results in a real rime operations the scheduling techniques has been used. In the paper we classify the various scheduling techniques based on different parameters. Also techniques used for scheduling in real time environment are analyzed and comparison between different techniques have been done. The various issues have been presented on which there is still a need to work.