On distributed scheduling with heterogeneously delayed network-state information

Authors:
Akula Aneesh Reddy;Siddhartha Banerjee;Aditya Gopalan;Sanjay Shakkottai;Lei Ying
Affiliations:
The University of Texas at Austin, Austin, USA 78712;The University of Texas at Austin, Austin, USA 78712;The University of Texas at Austin, Austin, USA 78712;The University of Texas at Austin, Austin, USA 78712;Iowa State University, Ames, USA 50011
Venue:
Queueing Systems: Theory and Applications
Year:
2012

Citing 12
Cited 0

Stable scheduling policies for fading wireless channels

IEEE/ACM Transactions on Networking (TON)
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm

Queueing Systems: Theory and Applications
Optimal channel probing and transmission scheduling for opportunistic spectrum access

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Scheduling with limited information in wireless systems

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Network adiabatic theorem: an efficient randomized protocol for contention resolution

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Optimality of myopic sensing in multichannel opportunistic access

IEEE Transactions on Information Theory
On scheduling in multi-channel wireless downlink networks with limited feedback

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Q-CSMA: queue-length based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
On optimal feedback allocation in multichannel wireless downlinks

Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Dynamic server allocation to parallel queues with randomly varying connectivity

IEEE Transactions on Information Theory
Limited feedback schemes for downlink OFDMA based on sub-channel groups

IEEE Journal on Selected Areas in Communications
On Wireless Scheduling With Partial Channel-State Information

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.