Scholarlink

<p>The proliferation of machine-type communications in 5G New Radio networks introduces challenges for uplink resource scheduling due to heterogeneous quality of service requirements and diverse traffic patterns. This paper proposes a QoS-aware uplink scheduler that balances throughput, fairness, and resource utilization. The proposed algorithm employs a recursive fitness function that integrates channel quality, priority, fairness, and a temporal urgency factor to satisfy quality of service constraints while mitigating user equipment starvation. Extensive simulation results demonstrate that the proposed scheduler achieves a near-Pareto-optimal trade-off among throughput, fairness, resource utilization, buffer occupancy, delay, and priority satisfaction compared to baseline scheduling algorithms, while maintaining polynomial-time computational complexity.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

QoS-aware resource scheduling for machine type communication in 5G networks

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年4月15日

查看全文
  • Ajay Khunteta,
  • Prashant Kumar Baheti

摘要

The proliferation of machine-type communications in 5G New Radio networks introduces challenges for uplink resource scheduling due to heterogeneous quality of service requirements and diverse traffic patterns. This paper proposes a QoS-aware uplink scheduler that balances throughput, fairness, and resource utilization. The proposed algorithm employs a recursive fitness function that integrates channel quality, priority, fairness, and a temporal urgency factor to satisfy quality of service constraints while mitigating user equipment starvation. Extensive simulation results demonstrate that the proposed scheduler achieves a near-Pareto-optimal trade-off among throughput, fairness, resource utilization, buffer occupancy, delay, and priority satisfaction compared to baseline scheduling algorithms, while maintaining polynomial-time computational complexity.