Packet Scheduling Algorithms with Fairness Control for CDMA Reverse Link
A larger amount of works has been reported for forward link CDMA scheduling compared to its reverse link case. In this paper, we propose generalized proportional fair (GPF) scheduling algorithms for uplink CDMA packet services, which have the ability to control the degree of fairness (DoF). We first...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | A larger amount of works has been reported for forward link CDMA scheduling compared to its reverse link case. In this paper, we propose generalized proportional fair (GPF) scheduling algorithms for uplink CDMA packet services, which have the ability to control the degree of fairness (DoF). We first establish a framework for GPF scheduling in wireless networks which render a GPF scheduling as a well-established optimization problem. For uplink CDMA, it is known that the rate sum maximization is achieved when the best K users in terms of channel condition transmit simultaneously. Based on this principle and the proposed GPF framework, we propose two GPF packet scheduling algorithms for uplink CDMA. Performance of our algorithms is verified through simulations. |
---|---|
ISSN: | 1090-3038 2577-2465 |
DOI: | 10.1109/VETECF.2008.359 |