Low-Complexity Scheduling Algorithm for Sum-Queue Minimization in Wireless Convergecast

Free registration required

Executive Summary

The authors consider the problem of link scheduling for efficient converge-cast in a wireless system. While there have been many results on scheduling algorithms that attain the maximum possible throughput in such a system, there has been few results that provide scheduling algorithms that are optimal in terms of some quality-of-service metric such as the probability that the end-to-end buffer usage exceeds a large threshold. Using a large deviations framework, the authors design a novel and low complexity algorithm that attains the best asymptotic decay rate of the probability of sum-queue overflow as the overflow threshold becomes large.

  • Format: PDF
  • Size: 122.4 KB