Two recursive schedulers for the uplink of LTE/LTE-A networks: M2M case study

Motivated by the requirement to circumvent the scale and complexity of handling packet traffic flows, two computationally-wise scheduling schemes are investigated in this study. Those schedulers focus on recursive algorithmic structures to map delay and volume characteristics onto the allocation decision process. Particularly for context and location aware services highlighting machine-to-machine communication, we demonstrate that both schedulers promote fairness and efficiency in respect to mean packet service delay and packet loss, while maintaining a reduced complexity.