Modern Random Access Protocols

Random access represents possibly the simplest and yet one of the best known approaches for sharing a channel among several users. Since their introduction in the 1970s, random access schemes have been thoroughly studied and small variations of the pioneering Aloha protocol have since then become a key component of many communications standards, ranging from satellite networks to ad hoc and cellular scenarios. A fundamental step forward for this old paradigm has been witnessed in the past few years, with the development of new solutions, mainly based on the principles of successive interference cancellation, which made it possible to embrace constructively collisions among packets rather than enduring them as a waste of resources. These new lines of research have rendered the performance of modern random access protocols competitive with that of their coordinated counterparts, paving the road for a multitude of new applications. This monograph explores the main ideas and design principles that are behind some of such novel schemes, and aims at offering to the reader an introduction to the analytical tools that can be used to model their performance. After reviewing some relevant thoretical results for the random access channel, the volume focuses on slotted solutions that combine the approach of diversity Aloha with successive interference cancellation, and discusses their optimisation based on an analogy with the theory of codes on graphs. The potential of modern random access is then further explored considering two families of schemes: the former based on physical layer network coding to resolve collisions among users, and the latter leaning on the concept of receiver diversity. Finally, the opportunities and the challenges encountered by random access solutions recently devised to operate in asynchronous, i.e., unslotted, scenarios are reviewed and discussed.

[1]  Anthony Ephremides,et al.  Information Theory and Communication Networks: An Unconsummated Union , 1998, IEEE Trans. Inf. Theory.

[2]  James L. Massey,et al.  The collision channel without feedback , 1985, IEEE Trans. Inf. Theory.

[3]  Etienne Perron,et al.  The on-off fading channel , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[4]  Petar Popovski,et al.  Frameless ALOHA Protocol for Wireless Networks , 2012, IEEE Communications Letters.

[5]  Lawrence G. Roberts,et al.  ALOHA packet system with and without slots and capture , 1975, CCRV.

[6]  Deniz Gündüz,et al.  Collision resolution in multiple access networks with physical-layer network coding and distributed fountain coding , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[7]  Massimo Franceschetti,et al.  Random Access: An Information-Theoretic Perspective , 2012, IEEE Transactions on Information Theory.

[8]  Ryuji Kohno,et al.  Cancellation techniques of co-channel interference in asynchronous spread spectrum multiple access systems , 1983 .

[9]  Andrea Munari,et al.  Multi-receiver Aloha systems - a survey and new results , 2015, 2015 IEEE International Conference on Communication Workshop (ICCW).

[10]  Christina Fragouli,et al.  Network Coding Applications , 2008, Found. Trends Netw..

[11]  Andrea Zanella,et al.  Theoretical Analysis of the Capture Probability in Wireless Systems with Multiple Packet Reception Capabilities , 2012, IEEE Transactions on Communications.

[12]  Michele Zorzi.  Mobile radio slotted ALOHA with capture, diversity and retransmission control in the presence of shadowing , 1998, Wirel. Networks.

[13]  Marco Chiani,et al.  High Throughput Random Access via Codes on Graphs: Coded Slotted ALOHA , 2011, 2011 IEEE International Conference on Communications (ICC).

[14]  Enrico Paolini.  Finite length analysis of irregular repetition slotted Aloha (IRSA) access protocols , 2015, 2015 IEEE International Conference on Communication Workshop (ICCW).

[15]  Soung Chang Liew,et al.  Physical-layer network coding: Tutorial, survey, and beyond , 2011, Phys. Commun..

[16]  R. A. McDonald,et al.  Noiseless Coding of Correlated Information Sources , 1973 .

[17]  R. De Gaudenzi,et al.  A high-performance MAC protocol for consumer broadband satellite systems , 2009 .

[18]  Alexandros G. Dimakis,et al.  SigSag: Iterative Detection Through Soft Message-Passing , 2011, IEEE Journal of Selected Topics in Signal Processing.

[19]  Michele Zorzi,et al.  On the design of practical asynchronous physical layer network coding , 2009, 2009 IEEE 10th Workshop on Signal Processing Advances in Wireless Communications.

[20]  N. Abramson,et al.  Multiple access in wireless digital networks , 1994, Proc. IEEE.

[21]  Jack M. Holtzman,et al.  Analysis of a simple successive interference cancellation scheme in a DS/CDMA system , 1994, IEEE J. Sel. Areas Commun..

[22]  Christian Kissling.  Performance Enhancements for Asynchronous Random Access Protocols over Satellite , 2011, 2011 IEEE International Conference on Communications (ICC).

[23]  Soung Chang Liew,et al.  > Replace This Line with Your Paper Identification Number (double-click Here to Edit) < 1 , 2022 .

[24]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[25]  Alex J. Grant,et al.  Convergence of linear interference cancellation multiuser receivers , 2001, IEEE Trans. Commun..

[26]  Mamoru Sawahashi,et al.  Coordinated multipoint transmission/reception techniques for LTE-advanced [Coordinated and Distributed MIMO] , 2010, IEEE Wireless Communications.

[27]  Thomas M. Cover,et al.  A Proof of the Data Compression Theorem of Slepian and Wolf for Ergodic Sources , 1971 .

[28]  Vladimir S. Crnojevic,et al.  Cooperative Slotted Aloha for Multi-Base Station Systems , 2014, IEEE Transactions on Communications.

[29]  Matteo Berioli,et al.  The throughput of slotted aloha with diversity , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[30]  M. Z. Win,et al.  MIMO Networks : The Effects of Interference , 2009 .

[31]  Dariush Divsalar,et al.  Improved parallel interference cancellation for CDMA , 1998, IEEE Trans. Commun..

[32]  Paul D. Alexander,et al.  Iterative detection in code-division multiple-access with error control coding , 1998, Eur. Trans. Telecommun..

[33]  R. Gallager.  Stochastic Processes , 2014 .

[34]  Norman Abramson,et al.  The Throughput of Packet Broadcasting Channels , 1977, IEEE Trans. Commun..

[35]  Giuseppe Cocco,et al.  Practical issues in multi-user physical layer network coding , 2012, 2012 6th Advanced Satellite Multimedia Systems Conference (ASMS) and 12th Signal Processing for Space Communications Workshop (SPSC).

[36]  Michele Zorzi,et al.  Correlation in diversity systems with Rayleigh fading, shadowing, and power capture , 1995, Proceedings of 6th International Symposium on Personal, Indoor and Mobile Radio Communications.

[37]  Petar Popovski,et al.  Error Floor Analysis of Coded Slotted ALOHA Over Packet Erasure Channels , 2015, IEEE Communications Letters.

[38]  Alessandro Giua,et al.  Guest Editorial , 2001, Discrete event dynamic systems.

[39]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[40]  C. Namislo.  Analysis of Mobile Radio Slotted ALOHA Networks , 1984, IEEE Journal on Selected Areas in Communications.

[41]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[42]  Michael Mitzenmacher,et al.  Analysis of random processes via And-Or tree evaluation , 1998, SODA '98.

[43]  A. Ephremides,et al.  An analysis of multi-receiver, non-adaptive, slotted Aloha with capture for wireless communications in factories , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[44]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[45]  Toshiaki Koike-Akino,et al.  Physical layer network coding for FSK systems , 2009, IEEE Communications Letters.

[46]  Marco Chiani,et al.  Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access , 2014, IEEE Transactions on Information Theory.

[47]  Marco Chiani,et al.  Performance versus overhead for fountain codes over Fq , 2010, IEEE Communications Letters.

[48]  Giuseppe Cocco,et al.  On the Feasibility of Satellite M2M Systems , 2012 .

[49]  Emre Telatar,et al.  Finite-length analysis of low-density parity-check codes on the binary erasure channel , 2002, IEEE Trans. Inf. Theory.

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

[51]  Dina Katabi,et al.  Zigzag decoding: combating hidden terminals in wireless networks , 2008, SIGCOMM '08.

[52]  Alan Slomson.  Introduction to Combinatorics , 1997 .

[53]  Sergio Verdu,et al.  Multiuser Detection , 1998 .

[54]  Petar Popovski,et al.  The Anti-Packets Can Increase the Achievable Throughput of a Wireless Multi-Hop Network , 2006, 2006 IEEE International Conference on Communications.

[55]  Marco Fiore,et al.  Exact Decoding Probability Under Random Linear Network Coding , 2010, IEEE Communications Letters.

[56]  Petar Popovski,et al.  All-to-all broadcast for vehicular networks based on coded slotted ALOHA , 2015, 2015 IEEE International Conference on Communication Workshop (ICCW).

[57]  Marco Chiani,et al.  Design and performance evaluation of some high-rate irregular low-density parity-check codes , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[58]  Giuseppe Cocco,et al.  Network-coded diversity protocol for collision recovery in slotted ALOHA networks , 2014, Int. J. Satell. Commun. Netw..

[59]  Gianluigi Liva,et al.  Graph-Based Analysis and Optimization of Contention Resolution Diversity Slotted ALOHA , 2011, IEEE Transactions on Communications.

[60]  Michael Lentmaier,et al.  Spatially-coupled random access on graphs , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[61]  Daniel A. Spielman,et al.  Improved low-density parity-check codes using irregular graphs and belief propagation , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[62]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[63]  Petar Popovski,et al.  ALOHA Random Access that Operates as a Rateless Code , 2013, IEEE Transactions on Communications.

[64]  G. Choudhury,et al.  Diversity ALOHA - A Random Access Scheme for Satellite Communications , 1983, IEEE Transactions on Communications.

[65]  R. De Gaudenzi,et al.  High Efficiency Satellite Multiple Access Scheme for Machine-to-Machine Communications , 2012, IEEE Trans. Aerosp. Electron. Syst..

[66]  Ehud Weinstein,et al.  Parameter estimation of superimposed signals using the EM algorithm , 1988, IEEE Trans. Acoust. Speech Signal Process..

[67]  W. D. Ray.  Queueing Systems. Vol. II—Computer Applications , 1977 .

[68]  Lawrence G. Roberts,et al.  Dynamic allocation of satellite capacity through packet reservation , 1973, AFIPS National Computer Conference.

[69]  Rudiger Urbanke,et al.  Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC , 2010, ISIT.

[70]  Lars K. Rasmussen,et al.  A matrix-algebraic approach to successive interference cancellation in CDMA , 2000, IEEE Trans. Commun..

[71]  Petar Popovski,et al.  Coded random access: applying codes on graphs to design random access protocols , 2014, IEEE Communications Magazine.

[72]  Deniz Gündüz,et al.  Collision Resolution in Slotted ALOHA with Multi-User Physical-Layer Network Coding , 2011, 2011 IEEE 73rd Vehicular Technology Conference (VTC Spring).

[73]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[74]  Christian Schlegel,et al.  Coordinated Multiuser Communications , 2006 .

[75]  Riccardo De Gaudenzi,et al.  Contention Resolution Diversity Slotted ALOHA (CRDSA): An Enhanced Random Access Schemefor Satellite Access Packet Networks , 2007, IEEE Transactions on Wireless Communications.

[76]  Hideki Imai,et al.  Combination of an Adaptive Array Antenna and a Canceller of Interference for Direct-Sequence Spread-Spectrum Multiple-Access System , 1990, IEEE J. Sel. Areas Commun..

[77]  Babak Hassibi,et al.  Capacity of wireless erasure networks , 2006, IEEE Transactions on Information Theory.

[78]  J. G. Andrews,et al.  Interference cancellation for cellular systems: a contemporary overview , 2005, IEEE Wireless Communications.

[79]  Georgios B. Giannakis,et al.  High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm , 2007, IEEE Transactions on Information Theory.

[80]  Henry D. Pfister,et al.  Iterative collision resolution for slotted ALOHA: An optimal uncoordinated transmission policy , 2012, 2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC).

[81]  Stuart C. Schwartz,et al.  Stability properties of slotted Aloha with multipacket reception capability , 1988 .