z-logo
open-access-imgOpen Access
Improving the performance of cell edge users with fractional coordinated fair scheduling
Author(s) -
Abiri Majid,
Mehrjoo Mehri
Publication year - 2014
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2014.0019
Subject(s) - scheduling (production processes) , computer science , spectral efficiency , proportionally fair , maximum throughput scheduling , heuristic , interference (communication) , computation , computer network , channel (broadcasting) , round robin scheduling , distributed computing , mathematical optimization , fair share scheduling , algorithm , mathematics , quality of service , artificial intelligence
In this study, the authors propose a fractional coordinated fair scheduling (FCFS) scheme for improving the performance of cell edge users in long term evolution (LTE‐advanced) networks. To enhance the network spectral efficiency and reduce co‐channel interference, they extend the inter‐cell interference coordination technique for multi‐sector cells. The sectors are coordinated in the sense that they are allowed to transmit simultaneously, if the neighbouring sectors co‐channel interference is less than a threshold value. Accordingly, a coordinated scheduling scheme is proposed to transmit to a fraction of users, located in cell edges, with good channel conditions. The proposed scheme maintains fairness among the users using alpha‐fair criterion. Furthermore, to reduce the computational complexity of the scheduling scheme, they propose a heuristic algorithm based on choosing an appropriate subset of users for scheduling computations. Performance evaluation of FCFS shows that the cell edge users’ throughput improves because of the spectral efficiency enhancement and interference reduction. Moreover, FCFS achieves a higher fairness index with respect to a non‐coordinated fair scheme.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here