Loading

Throughput and Fairness Optimal Scheduling for High Speed Cell Edge Users in LTE Networks
Ch. Rajasekhar1, D. Srinivasa Rao2, Ch. Venkata Rao3, V.B.S. Srilatha Indira Dutt4

1Ch. Rajasekhar, Department of ECE, GITAM Deemed to be University, Visakhapatnam (Andhra Pradesh), India.

2D. Srinivasa Rao, Department of ECE, GMRIT, Rajam (Andhra Pradesh), India.

3Ch.Venkata Rao, Department of ECE, GITAM Deemed to be University, Visakhapatnam (Andhra Pradesh), India.

4V.B.S. Srilatha Indira Dutt, Department of ECE, GITAM Deemed to be University, Visakhapatnam (Andhra Pradesh), India.

Manuscript received on 23 November 2019 | Revised Manuscript received on 11 December 2019 | Manuscript Published on 30 December 2019 | PP: 253-258 | Volume-9 Issue-2S3 December 2019 | Retrieval Number: B10641292S319/2019©BEIESP | DOI: 10.35940/ijitee.B1064.1292S319

Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: Guaranteeing Quality of Service (QoS) to mobile users is the primary aim of cellular broadband system like Long Term Evolution (LTE). Radio resource allocation and scheduling are two important functions in the LTE networks to enhance the quality of service. For increasing the generally user experience, an efficient radio resource allocation and Scheduling algorithm should be used. However, this became a non-trivial task as the demands and requirements of user data changes day-to-day. In these situations, with the limited radio resources, maximum system capacity can be obtained on expense of unfair share of the resources. In this work, high speed cell edge users are considered as they experience poor signal strength and their quality of service degrades when they move away from Evolved-Nodes (e-Nodes). Here, a novel scheduling algorithm has been introduced to extend the cell edge throughput amid during high mobility scenarios. The proposed scheduling scheme will be compared with the conventional schemes like best CQI, RR and PF in terms of throughput and fairness. It is presented that the proposed scheme gives better performance against the conventional ones in the chosen scenario.

Keywords: Bandwidth, Edge Users, Fairness, Latency, Throughput.
Scope of the Article: High Speed Networks