Tree-Algorithms with Multi-Packet Reception and Successive Interference Cancellation

In this paper, we perform a thorough analysis of tree-algorithms with multi-packet reception (MPR) and successive interference cancellation (SIC). We first derive the basic performance parameters, which are the expected length of the collision resolution interval and the normalized throughput, conditioned on the number of contending users. We then study their asymptotic behaviour, identifying an oscillatory component that amplifies with the increase in MPR. In the next step, we derive the throughput for the gated and windowed access, assuming Poisson arrivals. We show that for windowed access, the bound on maximum stable normalized throughput increases with the increase in MPR. We also analyze d-ary tree algorithms with MPR and SIC, showing deficiencies of the analysis performed in the seminal paper on tree-algorithms with SIC by Yu and Giannakis.

[1]  Petar Popovski,et al.  Sign-Compute-Resolve for Tree Splitting Random Access , 2016, IEEE Transactions on Information Theory.

[2]  Paul Mühlethaler,et al.  On the Performance of Irregular Repetition Slotted Aloha with Multiple Packet Reception , 2020, 2020 International Wireless Communications and Mobile Computing (IWCMC).

[3]  Philippe Flajolet,et al.  Mellin Transforms and Asymptotics: Harmonic Sums , 1995, Theor. Comput. Sci..

[4]  Moshe Sidi,et al.  Random Access Algorithms with Multiple Reception Capability and N-ary Feedback Channel , 1993 .

[5]  Christian Schlegel,et al.  Irregular repetition slotted ALOHA with multiuser detection , 2013, 2013 10th Annual Conference on Wireless On-demand Network Systems and Services (WONS).

[6]  Alberto Mengali,et al.  Enhancing the Physical Layer of Contention Resolution Diversity Slotted ALOHA , 2017, IEEE Transactions on Communications.

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

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

[9]  Benny Van Houdt,et al.  On the Maximum Stable Throughput of Tree Algorithms With Free Access , 2009, IEEE Transactions on Information Theory.

[10]  Muhammad Ali Imran,et al.  Uplink non-orthogonal multiple access for 5G wireless networks , 2014, 2014 11th International Symposium on Wireless Communications Systems (ISWCS).

[11]  Petar Popovski,et al.  Coded Random Access: How Coding Theory Helps to Build Random Access Protocols , 2014, ArXiv.

[12]  J. Massey.  Collision-Resolution Algorithms and Random-Access Communications , 1981 .

[13]  Gianluigi Liva,et al.  Asymptotic Performance of Coded Slotted ALOHA With Multipacket Reception , 2017, IEEE Communications Letters.

[14]  Wolfgang Kellerer,et al.  Analysis of Tree-Algorithms with Multi-Packet Reception , 2020, ArXiv.

[15]  Augustus J. E. M. Janssen,et al.  Analysis of contention tree algorithms , 2000, IEEE Trans. Inf. Theory.

[16]  Rung-Hung Gau.  Tree/Stack Splitting with Remainder for Distributed Wireless Medium Access Control with Multipacket Reception , 2011, IEEE Transactions on Wireless Communications.

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

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

[19]  Petar Popovski,et al.  A pseudo-Bayesian approach to sign-compute-resolve slotted ALOHA , 2015, 2015 IEEE International Conference on Communication Workshop (ICCW).

[20]  Cedomir Stefanovic,et al.  Irregular repetition slotted ALOHA over the Rayleigh block fading channel with capture , 2017, 2017 IEEE International Conference on Communications (ICC).

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

[22]  Yury Polyanskiy,et al.  Low complexity schemes for the random access Gaussian channel , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[23]  John Capetanakis,et al.  Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.

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

[25]  S. Verdu.  Computation of the efficiency of the Mosely-Humblet contention resolution algorithm: A simple method , 1986, Proceedings of the IEEE.

[26]  Philippe Flajolet,et al.  Q -ary collision resolution algorithms in random-access systems with free or blocked channel access , 1985, IEEE Trans. Inf. Theory.

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

[28]  Petar Popovski,et al.  Coded splitting tree protocols , 2013, 2013 IEEE International Symposium on Information Theory.

[29]  Lang Tong,et al.  Multipacket reception in random access wireless networks: from signal processing to optimal medium access control , 2001, IEEE Commun. Mag..

[30]  Danyo Danev,et al.  Multiple access adder channel , 2007 .