scholarly journals Comparative analysis of scheduling algorithms for radio resource allocation in future communication networks

2021 ◽  
Vol 7 ◽  
pp. e546
Author(s):  
Khuram Ashfaq ◽  
Ghazanfar Ali Safdar ◽  
Masood Ur-Rehman
Keyword(s):  
Communication Networks ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Base Station ◽  
System Level ◽  
Fractional Frequency Reuse ◽  
Resource Assignment ◽  
Radio Resource ◽  
Downlink Transmission ◽  
Wireless Links

Background Wireless links are fast becoming the key communication mode. However, as compared to the wired link, their characteristics make the traffic prone to time- and location-dependent signal attenuation, noise, fading, and interference that result in time varying channel capacities and link error rate. Scheduling algorithms play an important role in wireless links to guarantee quality of service (QoS) parameters such as throughput, delay, jitter, fairness and packet loss rate. The scheduler has vital importance in current as well as future cellular communications since it assigns resource block (RB) to different users for transmission. Scheduling algorithm makes a decision based on the information of link state, number of sessions, reserved rates and status of the session queues. The information required by a scheduler implemented in the base station can easily be collected from the downlink transmission. Methods This paper reflects on the importance of schedulers for future wireless communications taking LTE-A networks as a case study. It compares the performance of four well-known scheduling algorithms including round robin (RR), best channel quality indicator (BCQI), proportional fair (PF), and fractional frequency reuse (FFR). The performance of these four algorithms is evaluated in terms of throughput, fairness index, spectral efficiency and overall effectiveness. System level simulations have been performed using a MATLAB based LTE-A Vienna downlink simulator. Results The results show that the FFR scheduler is the best performer among the four tested algorithms. It also exhibits flexibility and adaptability for radio resource assignment.

scholarly journals Exhaustive Appraisal of Adaptive Hybrid LTE-A Downlink Scheduling Algorithm

2019 ◽  
Vol 9 (2) ◽  
pp. 4765-4772
Keyword(s):  
Resource Allocation ◽  
Spectral Efficiency ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Base Station ◽  
Network Simulator ◽  
Cell Edge ◽  
Fairness Index ◽  
Downlink Scheduling ◽  
Channel Quality

Long Term Evolution- Advanced (LTE-A) networks have been introduced in Third Generation Partnership Project (3GPP) release – 10 specifications, with an objective of obtaining a high data rate for the cell edge users, higher spectral efficiency and high Quality of service for multimedia services at the cell edge/Indoor areas. A Heterogeneous network (HetNet) in a LTE-A is a network consisting of high power macro-nodes and low power micro-nodes of different cell coverage capabilities. Due to this, non-desired signals acting as interference exist between the micro and macro nodes and their users. Interference is broadly classified as cross-tier and co-tier interference. The cross tier interference can be reduced by controlling the base station transmit power while the co-tier interference can be reduced by proper resource allocation among the users. Scheduling is the process of optimal allocation of resources to the users. For proper resource allocation, scheduling is done at the Main Base station (enodeB). Some LTE-A downlink scheduling algorithms are based on transmission channel quality feedback given by user equipment in uplink transmission. Various scheduling algorithms are being developed and evaluated using a network simulator. This paper presents the performance evaluation of the Adaptive Hybrid LTE-A Downlink scheduling algorithm. The evaluation is done in terms of parameters like user’s throughput (Peak, Average, and Edge), Average User’s spectral efficiency and Fairness Index. The evaluated results of the proposed algorithm is compared with the existing downlink scheduling algorithms such as Round Robin, Proportional Fair, Best Channel Quality Indicator (CQI) using a network simulator. The comparison results show the effectiveness of the proposed adaptive Hybrid Algorithm in improving the cell Edge user’s throughput as well the Fairness Index.

scholarly journals Intercell Interference Coordination through Limited Feedback

2010 ◽  
Vol 2010 ◽  
pp. 1-7 ◽  
Author(s):  
Lingjia Liu ◽  
Jianzhong (Charlie) Zhang ◽  
Jae-Chon Yu ◽  
Juho Lee
Keyword(s):  
Wireless Communication ◽  
Communication Networks ◽  
Limited Feedback ◽  
Base Station ◽  
Base Stations ◽  
System Level ◽  
Wireless Communication Networks ◽  
Interference Coordination ◽  
Average Cell ◽  
Intercell Interference

We consider the applications of multicell transmission schemes to the downlink of future wireless communication networks. A multicell multiple-input multiple output-(MIMOs) based scheme with limited coordination among neighboring base stations (BSs) is proposed to effectively combat the intercell interference by taking advantage of the degreesoffreedom in the spatial domain. In this scheme, mobile users are required to feedback channel-related information to both serving base station and interfering base station. Furthermore, a chordal distance-based compression scheme is introduced to reduce the feedback overhead. The performance of the proposed scheme is investigated through theoretical analysis as well as system level simulations. Both results suggest that the so-called “intercell interference coordination through limited feedback” scheme is a very good candidate for improving the cell-edge user throughput as well as the average cell throughput of the future wireless communication networks.

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.

Full duplex dispersion compensating system based on chromatic dispersion in analog RoF links

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Deyitha Dileep ◽  
Supriya S. Sindhu ◽  
Joseph Zacharias
Keyword(s):  
Communication Networks ◽  
Signal Transmission ◽  
Chromatic Dispersion ◽  
Base Station ◽  
Radio Over Fiber ◽  
Full Duplex ◽  
Downlink Transmission ◽  
Distortion Compensation ◽  
Fiber Technology ◽  
Signal Distortions

AbstractRadio over Fiber technology is a promising solution for next-generation wireless communication networks. In radio over fiber systems, signal distortions caused by modulator nonlinearity is a major concern. In this paper, a full duplex dispersion compensating system using chromatic dispersion is proposed. A system using 16 QAM OFDM signal transmission is presented. Distortion compensation is observed when a required amount of dispersion is added. Bit Error Rate (BER) and constellation diagrams for different amount of dispersion are analyzed and its comparison is presented. Since the framework utilizes just a single persistent wave laser for upstream and downstream transmission the base station is additionally disentangled and it diminishes the general framework cost. Signal distortions are reduced when the dispersion is adjusted to 640 ps/nm for uplink transmission and 760 ps/nm for downlink transmission.

scholarly journals Advanced Radio Resource Scheduling Algorithm for Energy Efficient Cellular Base Station

2017 ◽  
Vol 17 (AEROSPACE SCIENCES) ◽  
pp. 1-12
Author(s):  
Hany Abdel-Aziz ◽  
Fatma Newagy ◽  
Nelly Shafik ◽  
Ismail Hafez
Keyword(s):  
Energy Efficient ◽  
Scheduling Algorithm ◽  
Resource Scheduling ◽  
Base Station ◽  
Radio Resource ◽  
Radio Resource Scheduling

QoS aware Multi-Path Routing using Link Scheduling Algorithm

2019 ◽  
Vol 09 ◽  
Author(s):  
Satyasrikanth Palle ◽  
Shivashankar
Keyword(s):  
Cellular Networks ◽  
Scheduling Algorithm ◽  
Research Work ◽  
Scheduling Algorithms ◽  
Turnaround Time ◽  
Link Scheduling ◽  
Spatial Reuse ◽  
Mobile Cellular ◽  
Simulation Results ◽  
End To End

Objective: The demand for Cellular based multimedia services is growing day by day, in order to fulfill such demand the present day cellular networks needs to be upgraded to support excessive capacity calls along with high data accessibility. Analysis of traffic and huge network size could become very challenging issue for the network operators for scheduling the available bandwidth between different users. In the proposed work a novel QoS Aware Multi Path scheduling algorithm for smooth CAC in wireless mobile networks. The performance of the proposed algorithm is assessed and compared with existing scheduling algorithms. The simulation results show that the proposed algorithm outperforms existing CAC algorithms in terms of throughput and delay. The CAC algorithm with scheduling increases end-to-end throughput and decreases end-to-end delay. Methods: The key idea to implement the proposed research work is to adopt spatial reuse concept of wireless sensor networks to mobile cellular networks. Spatial reusability enhances channel reuse when the node pairs are far away and distant. When Src and node b are communicating with each other, the other nodes in the discovered path should be idle without utilizing the channel. Instead the other nodes are able to communicate parallelly the end-to-end throughput can be improved with acceptable delay. Incorporating link scheduling algorithms to this key concept further enhances the end-to-end throughput with in the turnaround time. So, in this research work we have applied spatial reuse concept along with link scheduling algorithm to enhance end-to-end throughput with in turnaround time. The proposed algorithm not only ensures that a connection gets the required bandwidth at each mobile node on its way by scheduling required slots to meet the QoS requirements. By considering the bandwidth requirement of the mobile connections, the CAC module at the BS not only considers the bandwidth requirement but also conforming the constrains of system dealy and jitter are met. Result: To verify the feasibility and effectiveness of our proposed work, with respect to scheduling the simulation results clearly shows the throughput improvement with Call Admission Control. The number of dropped calls is significantly less and successful calls are more with CAC. The percentage of dropped calls is reduced by 9 % and successful calls are improved by 91%. The simulation is also conducted on time constraint and ratio of dropped calls are shown. The total time taken to forward the packets and the ration of dropped calls is less when compared to non CAC. On a whole the CAC with scheduling algorithms out performs existing scheduling algorithms. Conclusion: In this research work we have proposed a novel QoS aware scheduling algorithm that provides QoS in Wireless Cellular Networks using Call Admission Control (CAC). The simulation results show that the end-to-end throughput has been increased by 91% when CAC is used. The proposed algorithm is also compared with existing link scheduling algorithms. The results reveal that CAC with scheduling algorithm can be used in Mobile Cellular Networks in order to reduce packet drop ratio. The algorithm is also used to send the packets within acceptable delay.

Parallel Scheduling Algorithms Investigation of Support Strict Resource Reservation from Grid

2014 ◽  
Vol 519-520 ◽  
pp. 108-113 ◽  
Author(s):  
Jun Chen ◽  
Bo Li ◽  
Er Fei Wang
Keyword(s):  
Parallel Computing ◽  
Resource Utilization ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Resource Reservation ◽  
Parallel Scheduling ◽  
Scheduling Model ◽  
Computing Grid ◽  
Simulation Results ◽  
Reservation Request

This paper studies resource reservation mechanisms in the strict parallel computing grid,and proposed to support the parallel strict resource reservation request scheduling model and algorithms, FCFS and EASY backfill analysis of two important parallel scheduling algorithm, given four parallel scheduling algorithms supporting resource reservation. Simulation results of four algorithms of resource utilization, job bounded slowdown factor and the success rate of Advanced Reservation (AR) jobs were studied. The results show that the EASY backfill + firstfit algorithm can ensure QoS of AR jobs while taking into account the performance of good non-AR jobs.

Sign in / Sign up

Export Citation Format

Share Document