Adaptive multi-user fair packet scheduling in HSDPA network

Next generation mobile networks are expected to provide seamless personal mobile communications and quality of service (QoS) guaranteed services. In this paper, the focus is on the packet scheduling of data generated by exhaustive applications. The performance of a new packet scheduling called adaptive proportional fair with user multiplexing (APFUM) is proposed and compared to the proportional fair scheduling. Bandwidth adaptation enables to increase network capacity while keeping a reasonable mean throughput of adapted users. Performance results show that the proposed algorithm is more effective in reducing the access delay and the rejection probability and in enhancing fairness. This benefit is obtained at the expense of introducing an adaptation rate.