A Fast-CSMA Algorithm for Deadline-Constrained Scheduling over Wireless Fading Channels

Recently, low-complexity and distributed Carrier Sense Multiple Access (CSMA)-based scheduling algorithms have attracted extensive interest due to their throughput-optimal characteristics in general network topologies. However, these algorithms are not well-suited for serving real-time traffic under time-varying channel conditions for two reasons: (1) the mixing time of the underlying CSMA Markov Chain grows with the size of the network, which, for large networks, generates unacceptable delay for deadline-constrained traffic; (2) since the dynamic CSMA parameters are influenced by the arrival and channel state processes, the underlying CSMA Markov Chain may not converge to a steady-state under strict deadline constraints and fading channel conditions. In this paper, we attack the problem of distributed scheduling for serving real-time traffic over time-varying channels. Specifically, we consider fully-connected topologies with independently fading channels (which can model cellular networks) in which flows with short-term deadline constraints and long-term drop rate requirements are served. To that end, we first characterize the maximal set of satisfiable arrival processes for this system and, then, propose a Fast-CSMA (FCSMA) policy that is shown to be optimal in supporting any real-time traffic that is within the maximal satisfiable set. These theoretical results are further validated through simulations to demonstrate the relative efficiency of the FCSMA policy compared to some of the existing CSMA-based algorithms.

[1]  Devavrat Shah,et al.  Network adiabatic theorem: an efficient randomized protocol for contention resolution , 2009, SIGMETRICS '09.

[2]  Peter Marbach,et al.  Throughput-optimal random access with order-optimal delay , 2010, 2011 Proceedings IEEE INFOCOM.

[3]  J. Dai.  On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[4]  Leandros Tassiulas.  Scheduling and performance limits of networks with constantly changing topology , 1997 .

[5]  Devavrat Shah,et al.  Hardness of low delay network scheduling , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[6]  Atilla Eryilmaz,et al.  Dynamic coding and rate-control for serving deadline-constrained traffic over fading channels , 2010, 2010 IEEE International Symposium on Information Theory.

[7]  John N. Tsitsiklis,et al.  Hardness of Low Delay Network Scheduling , 2011, IEEE Transactions on Information Theory.

[8]  Panganamala Ramana Kumar,et al.  Scheduling Heterogeneous Real-Time Traffic Over Fading Wireless Channels , 2014, IEEE/ACM Transactions on Networking.

[9]  Leandros Tassiulas,et al.  Dynamic server allocation to parallel queues with randomly varying connectivity , 1993, IEEE Trans. Inf. Theory.

[10]  Vivek S. Borkar,et al.  A Theory of QoS for Wireless , 2009, IEEE INFOCOM 2009.

[11]  R. Srikant,et al.  On the design of efficient CSMA algorithms for wireless networks , 2010, 49th IEEE Conference on Decision and Control (CDC).

[12]  Jian Ni,et al.  Distributed CSMA/CA algorithms for achieving maximum throughput in wireless networks , 2009, 2009 Information Theory and Applications Workshop.

[13]  J. Dai.  A fluid limit model criterion for instability of multiclass queueing networks , 1996 .

[14]  R. Srikant,et al.  Optimal Scheduling for Fair Resource Allocation in Ad Hoc Networks With Elastic and Inelastic Traffic , 2011, IEEE/ACM Transactions on Networking.

[15]  Atilla Eryilmaz,et al.  On the limitations of randomization for Queue-Length-Based Scheduling in wireless networks , 2011, 2011 Proceedings IEEE INFOCOM.

[16]  S. Meyn,et al.  Stability of Markovian processes I: criteria for discrete-time Chains , 1992, Advances in Applied Probability.

[17]  Jean C. Walrand,et al.  A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks , 2010, IEEE/ACM Transactions on Networking.

[18]  Jian Ni,et al.  Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks , 2010, INFOCOM 2010.

[19]  Ann Appl,et al.  On the Positive Harris Recurrence for Multiclass Queueing Networks: a Uniied Approach via Uid Limit Models , 1999 .

[20]  Leandros Tassiulas,et al.  Scheduling and performance limits of networks with constantly changing topology , 1997, IEEE Trans. Inf. Theory.