Title: Priority-based quality of service guaranteed radio resource allocation in long term evolution network

Authors: B. Rebekka; S. Sudheep; B. Malarkodi

Addresses: Department of Electronics and Communication Engineering, National Institute of Technology, Tiruchirappalli-620015, Tamil Nadu, India ' EEDP, General Electric Energy Management, Hyderabad, Telangana, India ' Department of Electronics and Communication Engineering, National Institute of Technology, Tiruchirappalli-620015, Tamil Nadu, India

Abstract: In this paper, radio resource allocation to users demanding priority for data transmission in the downlink of long term evolution (LTE) system is carried out. The proposed algorithm defines priority and non-priority user classes and considers minimum data rate requirement of each user. In this scenario, algorithm is implemented in a way to satisfy the priority users followed by allocating the radio resource to the remaining users. The performance analysis of existing conventional scheduling algorithms such as round robin (RR), best channel quality indicator (BCQI) and proportional fair (PF) is carried out, followed by implementation of the proposed algorithm. The simulation results show that compared to the conventional scheduling algorithms, the proposed algorithm makes efficient utilisation of the scarce radio spectrum and the users with priority have higher chance of achieving their minimum data rate requirement which corresponds to their quality of service (QoS) requirements being met irrespective of their channel conditions.

Keywords: long term evolution; LTE networks; data rate requirement; scheduling; quality of service; QoS; prioritised transmission; radio resource allocation; data transmission priority.

DOI: 10.1504/IJICT.2016.079963

International Journal of Information and Communication Technology, 2016 Vol.9 No.4, pp.420 - 437

Received: 16 May 2014
Accepted: 23 Dec 2014

Published online: 24 Oct 2016 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article