Resource-Redistributive Opportunistic Scheduling for Wireless Systems

Free registration required

Executive Summary

Opportunistic scheduling algorithms must balance throughput improvement (multiuser diversity) with externally imposed constraints on delay and fairness. For K users each with a weighted fairness constraint, the optimum solution is typically infeasible due to interdependence in the achievable rates. The contribution of this paper is a novel algorithm for achieving resource-sharing constraints with low complexity. This technique, termed Resource-Redistributive Opportunistic (RRO) scheduling, consists of an initial allocation and then a stochastic diversion of resources from surplus users to underserved users. This conceptually and numerically simple approach is shown to have some appealing properties.

  • Format: PDF
  • Size: 872.19 KB