A common information-based multiple access protocol achieving full throughput

We consider a multiple access communication system where multiple users share a common collision channel. In this system, coordination among users is essential to resolve collision issues. However, each system user can only observe its own local traffic and the feedback from the channel. Without a centralized controller, it is challenging to design an efficient coordination protocol. We present a decentralized common information-based multiple access protocol (CIMA). We show that under CIMA collision is totally avoided without channel sensing and the full throughput region of the collision channel is achieved. In addition, simulation results indicate that the CIMA protocol incurs low transmission delay.

[1]  Raphael Rom,et al.  Multiple Access Protocols: Performance and Analysis , 1990, SIGMETRICS Perform. Evaluation Rev..

[2]  Lei Ying,et al.  On Throughput Optimality With Delayed Network-State Information , 2008, IEEE Transactions on Information Theory.

[3]  Bogdan S. Chlebus,et al.  Adversarial Multiple Access Channel with Individual Injection Rates , 2009, OPODIS.

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

[5]  I PapadimitriouGeorgios.  A high performance MAC protocol for broadcast LANs with bursty traffic , 2006 .

[6]  Jinwoo Shin,et al.  Optimal CSMA: A survey , 2012, 2012 IEEE International Conference on Communication Systems (ICCS).

[7]  Devavrat Shah,et al.  Medium Access Using Queues , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[8]  Raphael Rom,et al.  Multiple Access Protocols: Performance and Analysis , 1990, SIGMETRICS Perform. Evaluation Rev..

[9]  Frank Thomson Leighton,et al.  Analysis of backoff protocols for multiple access channels , 1987, STOC '87.

[10]  H. Witsenhausen.  Separation of estimation and control for discrete time systems , 1971 .

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

[12]  Georgios I. Papadimitriou,et al.  Adaptive MAC protocols for broadcast networks with bursty traffic , 2003, IEEE Trans. Commun..

[13]  Dariusz R. Kowalski,et al.  Adversarial Queuing on the Multiple Access Channel , 2012, TALG.

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

[15]  Ashutosh Nayyar,et al.  Decentralized Stochastic Control with Partial History Sharing: A Common Information Approach , 2012, IEEE Transactions on Automatic Control.

[16]  Ashutosh Nayyar,et al.  The Common-Information Approach to Decentralized Stochastic Control , 2014 .

[17]  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.

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

[19]  W. Szpankowski.  Stability conditions for some distributed systems: buffered random access systems , 1994, Advances in Applied Probability.

[20]  Aditya Gopalan,et al.  On distributed scheduling with heterogeneously delayed network-state information , 2012, Queueing Syst. Theory Appl..

[21]  Georgios I. Papadimitriou.  A high performance MAC protocol for broadcast LANs with bursty traffic , 2006, Comput. Commun..

[22]  Qingsi Wang,et al.  Optimal Channel-Switching Strategies in Multi-channel Wireless Networks. , 2014 .

[23]  Anthony Ephremides,et al.  On the throughput, capacity, and stability regions of random multiple access , 2005, IEEE Transactions on Information Theory.

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

[25]  Yu-Chi Ho,et al.  Team decision theory and information structures , 1980 .

[26]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[27]  Wei Luo,et al.  Stability of N interacting queues in random-access systems , 1999, IEEE Trans. Inf. Theory.

[28]  Jinwoo Shin,et al.  Provable per-link delay-optimal CSMA for general wireless network topology , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

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

[30]  Sem C. Borst,et al.  Stability of Parallel Queueing Systems with Coupled Service Rates , 2006, Discret. Event Dyn. Syst..

[31]  Jean C. Walrand,et al.  Fast Mixing of Parallel Glauber Dynamics and Low-Delay CSMA Scheduling , 2010, IEEE Transactions on Information Theory.

[32]  Javad Ghaderi Dehkordi.  Fundamental limits of random access in wireless networks , 2013 .