Current developments in LTE/LTE-advanced: Adaptive-proportional fair scheduling in LTE

This paper provides analytical expressions to validate and evaluate the performance of long term evolution (lte) network in terms of throughput,spectral efficiency and sinr which are subjected to the constraint of proportional fairness amongst users from the enodeb. the proportional fair scheduling (pfs) algorithm is mainly focused on bandwidth allocation criterion in lte networks for supporting high resource utilization while maintaining high fairness among network flows to each distributed user equipment (ue). the most challenge of a pfs problem is the lack of analytic expression. though the pfs algorithm has been a research focus for some time,the results are mainly obtained from computer simulations. the current existing research applies a simplified form of the pfs preference metric and the given analytic expression is capable to support certain cases. the proposed model is refined with respect to uniform modulation and coding,as applied in lte networks. besides,we show that our models are approximate estimates for the performance of rate-based proportional fair scheduling,while they outperform some simpler prediction models from related work significantly.