Summary: 1
Scheduling Over Non­Stationary Wireless
Channels with Finite Rate Sets
Matthew Andrews Lisa Zhang
Abstract--- We consider a wireless basestation transmit­
ting high­speed data to multiple mobile users in a cell. The
channel conditions between the basestation and the users
are time­varying and user­dependent. We wish to define
which user to schedule at each time step. Previous work
on this problem has typically assumed that the channel con­
ditions are governed by a stationary stochastic process. In
this setting a popular algorithm known as Max­Weight has
been shown to have good performance.
However, the stationarity assumption is not always rea­
sonable. In this paper we study a more general worst­case
model in which the channel conditions are governed by an
adversary and are not necessarily stationary. In this model,
we show that the non­stationarities can cause Max­Weight
to have extremely poor performance. In particular, even
if the set of possible transmission rates is finite, as in the

Source: Andrews, Matthew - Mathematics of Networks and Systems, Mathematical Sciences Research Center, Bell Laboratories

Collections: Mathematics; Computer Technologies and Information Sciences