DIMACS TR: 2003-09

Uplink Scheduling in CDMA Packet-Data Systems



Authors: Krishnan Kumaran, Lijun Qian

ABSTRACT

Uplink scheduling in wireless systems is gaining importance due to arising uplink intensive data services (ftp, image uploads etc.), which could be hampered by the currently in-built asymmetry in favor of the downlink. In this work, we propose and study algorithms for efficient uplink packet-data scheduling in a CDMA cell. The algorithms attempt to maximize system throughput under transmit power limitations on the mobiles assuming instantaneous knowledge of user queues and channels. However no channel statistics or traffic characterization is necessary. Apart from increasing throughput, the algorithms also improve fairness of service among users, hence reducing chances of buffer overflows for poorly located users.

The major observation arising from our analysis is that it is advantageous on the uplink to schedule ``strong'' users one-at-a-time, and ``weak'' users in larger groups. This contrasts with the downlink where one-at-a-time transmission for all users has shown to be the preferred mode in much previous work. Based on the optimal schedules, we propose less complex and more practical approximate methods, both of which offer significant performance improvement compared to one-at-a-time transmission, and the widely acclaimed {\em Proportional Fair} (PF) algorithm, in simulations. When queue content cannot be fed back, we propose a simple modification of PF, {\em Uplink PF} (UPF), that offers similar improvement.

Paper Available at: ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/2003/2003-09.ps.gz

DIMACS Home Page