Stable scheduling policies for fading wireless channels

  • Authors:
  • Atilla Eryilmaz;R. Srikant;James R. Perkins

  • Affiliations:
  • Department of Electrical and Computer Engineering and the Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL;Department of Electrical and Computer Engineering and the Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL;Department of Manufacturing Engineering, Boston University, Boston, MA

  • Venue:
  • IEEE/ACM Transactions on Networking (TON)
  • Year:
  • 2005

Quantified Score

Hi-index 0.12

Visualization

Abstract

We study the problem of stable scheduling for a class of wireless networks. The goal is to stabilize the queues holding information to be transmitted over a fading channel. Few assumptions are made on the arrival process statistics other than the assumption that their mean values lie within the capacity region and that they satisfy a version of the law of large numbers. We prove that, for any mean arrival rate that lies in the capacity region, the queues will be stable under our policy. Moreover, we show that it is easy to incorporate imperfect queue length information and other approximations that can simplify the implementation of our policy.