Finite Length Analysis of Irregular Repetition Slotted ALOHA in the Waterfall Region

A finite length analysis is introduced for irregular repetition slotted ALOHA (IRSA) that enables to accurately estimate its performance in the moderate-to-high packet loss probability regime, i.e., in the so-called waterfall region. The analysis is tailored to the collision channel model, which enables mapping the description of the successive interference cancellation process onto the iterative erasure decoding of low-density parity-check codes. The analysis provides accurate estimates of the packet loss probability of IRSA in the waterfall region as demonstrated by Monte Carlo simulations.Comment: Accepted for publication in the IEEE Communications Letter

Frameless ALOHA with Reliability-Latency Guarantees

One of the novelties brought by 5G is that wireless system design has increasingly turned its focus on guaranteeing reliability and latency. This shifts the design objective of random access protocols from throughput optimization towards constraints based on reliability and latency. For this purpose, we use frameless ALOHA, which relies on successive interference cancellation (SIC), and derive its exact finite-length analysis of the statistics of the unresolved users (reliability) as a function of the contention period length (latency). The presented analysis can be used to derive the reliability-latency guarantees. We also optimize the scheme parameters in order to maximize the reliability within a given latency. Our approach represents an important step towards the general area of design and analysis of access protocols with reliability-latency guarantees.Comment: Accepted for presentation at IEEE Globecom 201

Finite Length Analysis of Irregular Repetition Slotted ALOHA in the Waterfall Region

A finite length analysis is introduced for irregular repetition slotted ALOHA (IRSA) that enables to accurately estimate its performance in the moderate-to-high packet loss probability regime, i.e., in the so-called waterfall region. The analysis is tailored to the collision channel model, which enables mapping the description of the successive interference cancella- tion process onto the iterative erasure decoding of low-density parity-check codes. The analysis provides accurate estimates of the packet loss probability of IRSA in the waterfall region as demonstrated by Monte Carlo simulations

On the Performance of Irregular Repetition Slotted Aloha with Multiple Packet Reception

International audienceA modern method of random access for packet networks, named ``Irregular Repetition Slotted Aloha (IRSA)'', had been proposed: it is based repeating transmitted packets, and on the use of successive interference cancellation at the receiver. In classical idealized settings of slotted random access protocols (where slotted ALOHA achieves 1/e), it has been shown that IRSA could asymptotically achieve the maximal throughput of 1 packet per slot. Additionally, IRSA had previously been studied for many different variants and settings, including the case where the receiver is equipped with ``multiple-packet reception'' (MPR) capability.In this article, we extensively revisit the case of IRSA with MPR. First, one of our major results is the proof that K-IRSA cannot reach the natural bound of throughput, and we prove a new, lower bound for its performance. Second, we give a simple expression for its excellent loss rate at lower loads. Third, we show how to formulate the search for the appropriate parameters of IRSA as an optimization problem, and how to solve it efficiently. By doing that for a comprehensive set of parameters, and by providing this work with simulations, we give numerical results that shed light on the performance of IRSA with MPR

Reliability-Latency Performance of Frameless ALOHA with and without Feedback

This paper presents a finite length analysis of multislot type frameless ALOHA based on a dynamic programming approach. The analysis is exact, but its evaluation is only feasible for moderate number of users due to the computational complexity. The analysis is then extended to derive continuous approximations of its key parameters, which, apart from providing an insight into the decoding process, make it possible to estimate the packet error rate with very low computational complexity. Finally, a feedback scheme is presented in which the slot access scheme is dynamically adapted according to the approximate analysis in order to minimize the packet error rate. The results indicate that the introduction of feedback can substantially improve the performance of frameless ALOH

Reliability-Latency Performance of Frameless ALOHA with and without Feedback

This paper presents a finite length analysis of multislot type frameless ALOHA based on a dynamic programming approach. The analysis is exact, but its evaluation is only feasible for moderate number of users due to the computational complexity. The analysis is then extended to derive continuous approximations of its key parameters, which, apart from providing an insight into the decoding process, make it possible to estimate the packet error rate with very low computational complexity. Finally, a feedback scheme is presented in which the slot access scheme is dynamically adapted according to the approximate analysis in order to minimize the packet error rate. The results indicate that the introduction of feedback can substantially improve the performance of frameless ALOH

大規模多元接続ネットワークのためのグラフ構造に基づくランダムアクセス方式

電気通信大学201

Finite-Length Analysis of Frameless ALOHA with Multi-User Detection

In this paper we present a finite-length analysis of frameless ALOHA for a k multi-user detection scenario, i.e., assuming the receiver can resolve collisions of size k or smaller. The analysis is obtained via a dynamical programming approach, and employed to optimize the scheme’s performance. We also assess the optimized performance as function of k. Finally, we verify the presented results through Monte Carlo simulations