Channel adaptive fair scheduling for CDMA/TDD downlink packet communications

In this paper we carry out a comparative study of different dynamic greedy frame-by-frame packet scheduling strategies with QoS guarantees. The considered environment is the downlink of a locally centralized (or bunched) CDMA/TDD wireless communication system. In particular, in order to address the trade-off between throughput and fairness, we first analyze the system performance using system-level metrics, and then proceed with a "user by user" investigation. We show that an appropriate design of the packet scheduling heuristics may lead to significant performance improvements in terms of total user level of satisfaction, at the price of a small degradation of the system throughput.