On the performance of Heuristic opportunistic scheduling in the uplink of 3G LTE networks

In this paper we study the performance of the heuristic localized gradient algorithm (HLGA) that was designed for uplink scheduling in 3G long term evolution (LTE) systems. The performance of the algorithm is examined when dynamic traffic models are assumed. With dynamic traffic, users will have different buffer occupancies. The amount of resources granted to a user need to be mapped to the size of those occupancies. We suggest for that, a procedure called dasiapruningpsila where resources are given to users who maximize a certain criteria and later on prune the extra resources and allocate them to other users. We also study the performance loss caused by more realistic assumptions on base station knowledge of the terminalpsilas buffer state. We first assume no delay in the reporting of the buffer occupancy but later evaluate the effect of buffer reporting delays and quantification of data used to report the status of a buffer.