Exploiting capture effect in frameless ALOHA for massive wireless random access

The analogies between successive interference cancellation (SIC) in slotted ALOHA framework and iterative belief-propagation erasure-decoding, established recently, enabled the application of the erasure-coding theory and tools to design random access schemes. This approach leads to throughput substantially higher than the one offered by the traditional slotted ALOHA. In the simplest setting, SIC progresses when a successful decoding occurs for a single user transmission. In this paper we consider a more general setting of a channel with capture and explore how such physical model affects the design of the coded random access protocol. Specifically, we assess the impact of capture effect in Rayleigh fading scenario on the design of SIC-enabled slotted ALOHA schemes. We provide analytical treatment of frameless ALOHA, which is a special case of SIC-enabled ALOHA scheme. We demonstrate both through analytical and simulation results that the capture effect can be very beneficial in terms of achieved throughput.

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

[2]  H. Okada,et al.  Analysis and application of framed ALOHA channel in satellite packet switching networks - FADRA method , 1977 .

[3]  Christian Namislo Analysis of mobile radio slotted ALOHA networks , 1984, IEEE Transactions on Vehicular Technology.

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

[5]  Anthony Ephremides,et al.  An exact analysis and performance evaluation of framed ALOHA with capture , 1989, IEEE Trans. Commun..

[6]  Michele Zorzi,et al.  Capture and retransmission control in mobile radio , 1994, IEEE J. Sel. Areas Commun..

[7]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

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

[9]  Anthony Ephremides,et al.  On Capture in Random-Access Systems , 2006, 2006 IEEE International Symposium on Information Theory.

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

[11]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[12]  Marco Chiani,et al.  Graph-Based Random Access for the Collision Channel without Feedback: Capacity Bound , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

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

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

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

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

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

[18]  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).

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