Optimum and suboptimum scheduling schemes are proposed in the uplink of array antenna systems. We assume that once a user is permitted to transmit the data, the user transmits the data using the maximum power, and adjusts the transmission bit rate so that the energy-per-bit-to-interference-plus-noise-density ratio should be equal or higher than a threshold. In this system model, we consider an optimization problem: How many and which users should be selected to transmit their data at a time in order to maximize the throughput? Based on the analysis on the complexity of the optimum scheme, we propose another optimum scheme having reduced complexity. To reduce the complexity further, we also propose three suboptimum scheduling schemes by limiting the number of users simultaneously transmitting, by choosing the users with higher channel gains, and by partitioning a cell into multiple parts. In circular and linear arrays, the performance results of all the proposed schemes are presented and compared.

Weighted fair queueing (WFQ)-based packet scheduling schemes require processing at line speeds for tag computation and tag sorting. This requirement presents a bottleneck for their implementation at high transmission speeds. We propose an alternative and lower complexity approach to packet scheduling, based on modifications of the classical round-robin scheduler. Contrary to conventional belief, we show that appropriate modifications of the weighted round-robin (WRR) service discipline can, in fact, provide tight fairness properties and efficient delay guarantees to multiple sessions. Two such modifications are described: 1) list-based round robin, in which the server visits different sessions according to a precomputed list which is designed to obtain the desirable scheduling properties; 2) multiclass round robin, a version of hierarchical round robin with controls designed for good scheduling properties. The schemes considered are compared with well-known WFQ schemes and with deficit round robin (a credit-based WRR), on the basis of desirable properties such as bandwidth guarantees, fairness in excess bandwidth sharing, worst-case fairness, and efficiency of latency (delay guarantee) tuning. The scheduling schemes proposed and analyzed here operate with fixed packet sizes, and hence can be used in applications such as cell scheduling in ATM networks, time-slot scheduling on wireless links as in GPRS air interface, etc. A credit-based extension of the proposed schemes to handle variable packet sizes is also possible.

Quality of service (QoS) provisioning in wireless networks involves accounting for the statistical fluctuations in the wireless channel quality, in addition to the traffic variability of interest in a purely wireline setting. We consider providing QoS to packetized, delay-constrained (real-time) applications over a Rayleigh-faded wireless downlink. Since the wireless medium is prone to high error rates with typically correlated errors, it is essential to use some kind of link-layer error-recovery mechanism to provide the desired level of reliability. We call this procedure of converting a link with frequent and correlated errors into a near-lossless packet pipe "link shaping." The link-shaping scheme considered in this paper exploits the natural interleaving provided by packet-by-packet transmissions to different mobiles to break up the error correlations due to Rayleigh fading and employs forward error correction (FEC) coding on the interleaved data. In addition to considering static (peak-rate) bandwidth sharing as in conventional wireless downlinks, we propose mechanisms for statistical multiplexing of traffic, which lead to substantial capacity gains. For example, for 13 kb/s voice sources over a 1-Mb/s link, we obtain a two-fold capacity gain over static (peak-rate) bandwidth allocation.

This paper considers the problem of supporting TCP, the Internet data transport protocol, over a lossy wireless link whose quality varies over time. In order to prevent throughput degradation, it is necessary to "hide" the losses and the time variations of the wireless link from TCP. A number of solutions to this problem have been proposed in previous studies, but their performance was studied on a purely experimental basis. This paper presents an approximate analysis, validated by computer simulations, for TCP performance over wireless links. The analysis provides the basis for a systematic approach to supporting TCP over wireless links. The specific case of a Rayleigh-faded wireless link and automatic repeat request-based link-layer recovery is considered for the purpose of illustration. The numerical results presented for this case show that a simple solution, that of using an appropriately designed link-layer error-recovery scheme, prevents excessive deterioration of TCP throughput on wireless links.