Mobility

Delay Analysis for Maximal Scheduling Algorithms to Minimize the Queue Overflow Probability

Download Now Free registration required

Executive Summary

Scheduling is an important functionality in wireless networks due to both the shared nature of the wireless medium and the variations of the wireless channel over time. To focus on wireless scheduling algorithm for a downlink of a single cell that can minimize the queue overflow probability. In the past, it has been demonstrated that, by carefully choosing the scheduling decisions based on the channel state and/or the demand of the users, the system performance can be substantially improved. Most studies of scheduling algorithms have focused on optimizing the long term average throughput of the users. The goal is to find algorithms for scheduling the transmissions such that the queues are stabilized at given offered load.

  • Format: PDF
  • Size: 267.7 KB