Throughput-optimal random access with order-optimal delay

In this paper, we consider CSMA policies for scheduling packet transmissions in multihop wireless networks with one-hop traffic. The main contribution of the paper is to propose a novel CSMA policy, called Unlocking CSMA (U-CSMA), that enables to obtain both high throughput and low packet delays in large wireless networks. More precisely, we show that for torus interference graph topologies with one-hop traffic, U-CSMA is throughput optimal and achieves order-optimal delay. For one-hop traffic, the delay performance is defined to be order-optimal if the delay stays bounded as the network-size increases. Simulations that we conducted suggest that (a) U-CSMA is throughput-optimal and achieves order-optimal delay for general geometric interference graphs and (b) that U-CSMA can be combined with congestion control algorithms to maximize the network-wide utility and obtain order-optimal delay. To the best of our knowledge, this is the first time that a simple distributed scheduling policy has been proposed that is both throughput/utility optimal and achieves order-optimal delay.

[1]  Norman Abramson,et al.  The ALOHA System-Another Alternative for Computer Communications , 1899 .

[2]  D. S. Gaunt,et al.  Hard‐Sphere Lattice Gases. I. Plane‐Square Lattice , 1965 .

[3]  Norman M. Abramson,et al.  THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).

[4]  H. Peters,et al.  Radius, perimeter, and density profile for percolation clusters and lattice animals , 1979 .

[5]  Bruce Hajek,et al.  Decentralized dynamic control of a multiaccess broadcast channel , 1982 .

[6]  R. Jullien,et al.  Scaling properties of the surface of the Eden model in d=2, 3, 4 , 1985 .

[7]  I. MacPhee,et al.  The Number of Packets Transmitted by Collision Detect Random Access Schemes , 1987 .

[8]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[9]  Frank Thomson Leighton,et al.  Analysis of Backoff Protocols for Multiple Access Channels , 1996, SIAM J. Comput..

[10]  Harry B. Hunt,et al.  NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs , 1998, J. Algorithms.

[11]  A. Borovkov.  Probability Theory , 1998 .

[12]  Alan M. Frieze,et al.  Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[13]  Sampath Kannan,et al.  A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols , 2000, ICALP.

[14]  Eric Vigoda,et al.  A Note on the Glauber Dynamics for Sampling Independent Sets , 2001, Electron. J. Comb..

[15]  Eytan Modiano,et al.  Dynamic power allocation and routing for time varying wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[16]  Harold J. Kushner,et al.  Control of mobile communication systems with time-varying channels via stability methods , 2004, IEEE Transactions on Automatic Control.

[17]  H. Kesten.  Probability on discrete structures , 2004 .

[18]  Sampath Kannan,et al.  A bound on the capacity of backoff and acknowledgment-based protocols , 2004, SIAM J. Comput..

[19]  N. Markley.  Principles of differential equations , 2004 .

[20]  Eytan Modiano,et al.  Fairness and Optimal Stochastic Control for Heterogeneous Networks , 2005, IEEE/ACM Transactions on Networking.

[21]  A. Girotra,et al.  Performance Analysis of the IEEE 802 . 11 Distributed Coordination Function , 2005 .

[22]  R. Srikant,et al.  Stable scheduling policies for fading wireless channels , 2005, IEEE/ACM Transactions on Networking.

[23]  François Baccelli,et al.  An Aloha protocol for multihop mobile wireless networks , 2006, IEEE Transactions on Information Theory.

[24]  Ness B. Shroff,et al.  The impact of imperfect scheduling on cross-Layer congestion control in wireless networks , 2006, IEEE/ACM Transactions on Networking.

[25]  Xiaojun Lin,et al.  The impact of imperfect scheduling on cross-Layer congestion control in wireless networks , 2006, IEEE/ACM Transactions on Networking.

[26]  Ness B. Shroff,et al.  On the Complexity of Scheduling in Wireless Networks , 2006, MobiCom '06.

[27]  J. Walrand,et al.  Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits , 2006, Advances in Applied Probability.

[28]  A. Robert Calderbank,et al.  Utility-optimal random-access control , 2007, IEEE Transactions on Wireless Communications.

[29]  Asuman E. Ozdaglar,et al.  Achievable rate region of CSMA schedulers in wireless networks with primary interference constraints , 2007, 2007 46th IEEE Conference on Decision and Control.

[30]  A Distributed Algorithm for Maximal Throughput and Optimal Fairness in Wireless Networks with a General Interference Model , 2008 .

[31]  Alexandre Proutière,et al.  Complexity in wireless scheduling: impact and tradeoffs , 2008, MobiHoc '08.

[32]  Patrick Thiran,et al.  Border Effects, Fairness, and Phase Transition in Large Wireless Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[33]  Alexander L. Stolyar.  Dynamic Distributed Scheduling in Random Access Networks , 2005 .

[34]  Michael J. Neely,et al.  Delay Analysis for Maximal Scheduling in Wireless Networks with Bursty Traffic , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[35]  Eytan Modiano,et al.  Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[36]  Jean-Yves Le Boudec,et al.  A class of mean field interaction models for computer and communication systems , 2008, Perform. Evaluation.

[37]  Michele Garetto,et al.  Modeling per-flow throughput and capturing starvation in CSMA multi-hop wireless networks , 2008, TNET.

[38]  Eytan Modiano,et al.  Delay analysis of maximum weight scheduling in wireless Ad Hoc networks , 2009, 2009 43rd Annual Conference on Information Sciences and Systems.

[39]  Jean Walrand,et al.  Approaching throughput-optimality in a distributed CSMA algorithm: collisions and stability , 2009, MobiHoc S3 '09.

[40]  Mahdi Lotfinezhad,et al.  On channel access delay of CSMA policies in wireless networks with primary interference constraints , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[41]  Vincent W. S. Wong,et al.  Utility-optimal random access without message passing , 2009, IEEE Transactions on Wireless Communications.

[42]  Ness B. Shroff,et al.  Understanding the capacity region of the Greedy maximal scheduling algorithm in multihop wireless networks , 2009, TNET.

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

[44]  R. Srikant,et al.  Distributed Link Scheduling With Constant Overhead , 2006, IEEE/ACM Transactions on Networking.

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

[46]  Alexandre Proutière,et al.  Resource Allocation over Network Dynamics without Timescale Separation , 2010, 2010 Proceedings IEEE INFOCOM.

[47]  Ness B. Shroff,et al.  Delay analysis for wireless networks with single hop traffic and general interference constraints , 2010, IEEE/ACM Trans. Netw..

[48]  Shang-Yuan Shiu,et al.  Probability on discrete structures , 2010 .

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

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