A Heuristic Scheduling Scheme in Multiuser OFDMA Networks

Simple item page
dc.creatorSun, Zheng
dc.creatorHe, Zhiqiang
dc.creatorWang, Ruochen
dc.creatorNiu, Kai
dc.date2008-09-19
dc.date.accessioned2026-07-07T10:03:58Z
dc.date.available2026-07-07T10:03:58Z
dc.descriptionConventional heterogeneous-traffic scheduling schemes utilize zero-delay constraint for real-time services, which aims to minimize the average packet delay among real-time users. However, in light or moderate load networks this strategy is unnecessary and leads to low data throughput for non-real-time users. In this paper, we propose a heuristic scheduling scheme to solve this problem. The scheme measures and assigns scheduling priorities to both real-time and non-real-time users, and schedules the radio resources for the two user classes simultaneously. Simulation results show that the proposed scheme efficiently handles the heterogeneous-traffic scheduling with diverse QoS requirements and alleviates the unfairness between real-time and non-real-time services under various traffic loads.
dc.descriptionpublished in VTC Fall '08
dc.identifierhttps://arxiv.org/abs/0809.3280
dc.identifierhttp://arxiv.org/abs/0809.3280
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/169495
dc.subjectNetworking and Internet Architecture
dc.titleA Heuristic Scheduling Scheme in Multiuser OFDMA Networks
dc.typetext

Files

Collections

arXiv