Details

Autor(en) / Beteiligte

• Eryilmaz, A.
• Srikant, R.
• Perkins, J.R.

Titel

Stable scheduling policies for fading wireless channels

Ist Teil von

• IEEE/ACM transactions on networking, 2005-04, Vol.13 (2), p.411-424

Ort / Verlag

New York: IEEE

Erscheinungsjahr

2005

Link zum Volltext

• IEEE_Xplore

Quelle

IEEE Electronic Library (IEL)

Beschreibungen/Notizen

• 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.