The paper is a study of scheduling schemes for providing high-speed data services in time division-code division multiple access (TD-CDMA) systems, especially mobile wireless networks. In particular, channel-based only (CBO), random scheduling (RS), and round robin (RR) schemes are analyzed; channel-based proportional-fair (CB+PF) schemes are not studied because of the high variation in achieved throughput that is not controlled. The paper is an introduction to “a fair packet scheduling scheme that takes [into account] both channel conditions and achieved throughput.” The paper also introduces “a new system-dependent tolerance factor,” L, that controls the extent of the allowable maximum “achieved average rate” relative to the required rate, in a fair manner, for each mobile terminal (MT).

The paper includes four sections that discuss: the TD-CDMA model (Section 2); the CBO, RS, RR, and CB+PF schemes (Section 3); the new “channel-based, mobile-assisted, fairly-shared” (CB+MA+FS) scheme (Section 4); and the verification of the effectiveness and efficiency of the CB+MA+FS scheme compared to the others (Section 5).

There is a short summary, in which further research to take into account “the effect of user mobility and associated hand-off and traffic patterns with hotspots” is proposed.

The verification is done via simulation, with two square cells consisting of 100 “uniformly distributed” users and “schedulers in two cells [that] schedule the MTs separately.” Table 1 gives simulation parameters, with L varying from zero to 20, and data rates ranging from 100 kilobits per second (kbps) to 800 kbps.