Quality of Service Class Identifier (QCI) radio resource allocation algorithm for LTE downlink
The increasing demand for network applications, such as teleconferencing, multimedia messaging and mobile TV, which have diverse requirements, has resulted in the introduction of Long Term Evolution (LTE) by the Third Generation Partnership Project (3GPP). LTE networks implement resource allocation...
Saved in:
| Published in: | PloS one Vol. 14; no. 1; p. e0210310 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
United States
Public Library of Science
01.01.2019
Public Library of Science (PLoS) |
| Subjects: | |
| ISSN: | 1932-6203, 1932-6203 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The increasing demand for network applications, such as teleconferencing, multimedia messaging and mobile TV, which have diverse requirements, has resulted in the introduction of Long Term Evolution (LTE) by the Third Generation Partnership Project (3GPP). LTE networks implement resource allocation algorithms to distribute radio resource to satisfy the bandwidth and delay requirements of users. However, the scheduling algorithm problem of distributing radio resources to users is not well defined in the LTE standard and thus considerably affects transmission order. Furthermore, the existing radio resource algorithm suffers from performance degradation under prioritised conditions because of the minimum data rate used to determine the transmission order. In this work, a novel downlink resource allocation algorithm that uses quality of service (QoS) requirements and channel conditions to address performance degradation is proposed. The new algorithm is formulated as an optimisation problem where network resources are allocated according to users' priority, whereas the scheduling algorithm decides on the basis of users' channel status to satisfy the demands of QoS. Simulation is used to evaluate the performance of the proposed algorithm, and results demonstrate that it performs better than do all other algorithms according to the measured metrics. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 Competing Interests: The authors have declared that no competing interests exist. |
| ISSN: | 1932-6203 1932-6203 |
| DOI: | 10.1371/journal.pone.0210310 |