Queueing Systems

, Volume 72, Issue 3–4, pp 193–218

On distributed scheduling with heterogeneously delayed network-state information

  • Akula Aneesh Reddy
  • Siddhartha Banerjee
  • Aditya Gopalan
  • Sanjay Shakkottai
  • Lei Ying
Article

DOI: 10.1007/s11134-012-9312-z

Cite this article as:
Reddy, A.A., Banerjee, S., Gopalan, A. et al. Queueing Syst (2012) 72: 193. doi:10.1007/s11134-012-9312-z

Abstract

We study the problem of distributed scheduling in wireless networks, where each node makes individual scheduling decisions based on heterogeneously delayed network state information (NSI). This leads to inconsistency in the views of the network across nodes, which, coupled with interference, makes it challenging to schedule for high throughputs.

We characterize the network throughput region for this setup, and develop optimal scheduling policies to achieve the same. Our scheduling policies have a threshold-based structure and, moreover, require the nodes to use only the “smallest critical subset” of the available delayed NSI to make decisions. In addition, using Markov chain mixing techniques, we quantify the impact of delayed NSI on the throughput region. This not only highlights the value of extra NSI for scheduling, but also characterizes the loss in throughput incurred by lower complexity scheduling policies which use homogeneously delayed NSI.

Keywords

Wireless networks Scheduling algorithms Delayed information 

Mathematics Subject Classification

94 

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Akula Aneesh Reddy
    • 1
  • Siddhartha Banerjee
    • 1
  • Aditya Gopalan
    • 1
  • Sanjay Shakkottai
    • 1
  • Lei Ying
    • 2
  1. 1.The University of Texas at AustinAustinUSA
  2. 2.Iowa State UniversityAmesUSA

Personalised recommendations