Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A SURVEY OF SCHEDULING THEORY IN WIRELESS DATA NETWORKS
 

Summary: A SURVEY OF SCHEDULING THEORY IN
WIRELESS DATA NETWORKS
MATTHEW ANDREWS #
Abstract. We survey some results for scheduling data in wireless data systems such as 1xEV­DO.
An important feature of such systems is that the channel rates between the basestation and the mobile
users are both user­dependent and time­varying. The wireless data scheduling problem has recently
received a great deal of attention in the literature. However, comparisons of results are sometimes
difficult due to the fact that many different models have been studied. In this survey we describe some
of the models that have been proposed and analyze the performance of different scheduling algorithms
within these models.
1. Introduction. The advent of third­generation wireless systems such as
CDMA2000 1xEV­DO [15, 18] means that mobile Internet users can now obtain
high data rates in cellular systems. However, in order to effectively utilize the
wireless capacity, we require efficient methods for deciding how the wireless re­
sources should be assigned. In particular, we require scheduling algorithms that
determine which user should be served in each time step.
In this paper we survey some of the basic results about scheduling in wireless
data systems. The most important feature of such systems is that due to channel
fading and user mobility, the rates at which users can receive data are both user­
dependent and time­varying. In particular, when a user is close to the transmitter

  

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

 

Collections: Mathematics; Computer Technologies and Information Sciences