TY - GEN
T1 - Wireless scheduling with heterogeneously delayed network-state information
AU - Reddy, Akula Aneesh
AU - Banerjee, Siddhartha
AU - Gopalan, Aditya
AU - Shakkottai, Sanjay
AU - Ying, Lei
PY - 2010/12/1
Y1 - 2010/12/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=79952423351&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79952423351&partnerID=8YFLogxK
U2 - 10.1109/ALLERTON.2010.5707101
DO - 10.1109/ALLERTON.2010.5707101
M3 - Conference contribution
AN - SCOPUS:79952423351
SN - 9781424482146
T3 - 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010
SP - 1577
EP - 1584
BT - 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010
T2 - 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010
Y2 - 29 September 2010 through 1 October 2010
ER -