Medium Access Using Queues

Consider a wireless network of n nodes represented by a (undirected) graph G where an edge (i,j) models the fact that transmissions of i and j interfere with each other, i.e. simultaneous transmissions of i and j become unsuccessful. Hence it is required that at each time instance a set of non-interfering nodes (corresponding to an independent set in G) access the wireless medium. To utilize wireless resources efficiently, it is required to arbitrate the access of medium among interfering nodes properly. Moreover, to be of practical use, such a mechanism is required to be totally distributed as well as simple. As the main result of this paper, we provide such a medium access algorithm. It is randomized, totally distributed and simple: each node attempts to access medium at each time with probability that is a function of its local information. We establish efficiency of the algorithm by showing that the corresponding network Markov chain is positive recurrent as long as the demand imposed on the network can be supported by the wireless network (using any algorithm). In that sense, the proposed algorithm is optimal in terms of utilizing wireless resources. The algorithm is oblivious to the network graph structure, in contrast with the so-called polynomial back-off algorithm by Hastad-Leighton-Rogoff (STOC '87, SICOMP '96) that is established to be optimal for the complete graph and bipartite graphs (by Goldberg-MacKenzie (SODA '96, JCSS '99)).

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

[2]  A. Stolyar.  MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic , 2004 .

[3]  Pierre A. Humblet,et al.  A Class of Efficient Contention Resolution Algorithms for Multiple Access Channels , 1985, IEEE Trans. Commun..

[4]  Robert Metcalfe,et al.  Ethernet: distributed packet switching for local computer networks , 1976, CACM.

[5]  Devavrat Shah,et al.  Efficient Distributed Medium Access , 2011, ArXiv.

[6]  Frank Kelly,et al.  Stochastic Models of Computer Communication Systems , 1985 .

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

[8]  Hans-Otto Georgii,et al.  Gibbs Measures and Phase Transitions , 1988 .

[9]  David J. Aldous.  Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels , 1987, IEEE Trans. Inf. Theory.

[10]  Norman Abramson,et al.  The ALOHA SYSTEM. , 1972 .

[11]  Devavrat Shah,et al.  Randomized Scheduling Algorithm for Queueing Networks , 2009, ArXiv.

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

[13]  Ravi Montenegro,et al.  Mathematical Aspects of Mixing Times in Markov Chains , 2006, Found. Trends Theor. Comput. Sci..

[14]  Jean C. Walrand,et al.  Distributed Random Access Algorithm: Scheduling and Congestion Control , 2009, IEEE Transactions on Information Theory.

[15]  Devavrat Shah,et al.  Optimal Scheduling Algorithms for Input-Queued Switches , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[16]  Martin E. Dyer,et al.  A random polynomial-time algorithm for approximating the volume of convex bodies , 1991, JACM.

[17]  Alistair Sinclair,et al.  Algorithms for Random Generation and Counting: A Markov Chain Approach , 1993, Progress in Theoretical Computer Science.

[18]  Leslie Ann Goldberg,et al.  Analysis of practical backoff protocols for contention resolution with multiple servers , 1996, SODA '96.

[19]  Robert Metcalfe,et al.  Ethernet: distributed packet switching for local computer networks , 1988, CACM.

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

[21]  V. Anantharam,et al.  A proof of the Markov chain tree theorem , 1989 .

[22]  Martin E. Dyer,et al.  A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies , 1989, STOC.

[23]  S. Foss,et al.  AN OVERVIEW OF SOME STOCHASTIC STABILITY METHODS( Network Design, Control and Optimization) , 2004 .

[24]  Jean C. Walrand,et al.  Approaching Throughput-Optimality in Distributed CSMA Scheduling Algorithms With Collisions , 2010, IEEE/ACM Transactions on Networking.