137 research outputs found
Asymptotic and Finite Frame Length Analysis of Frame Asynchronous Coded Slotted ALOHA
We consider a frame-asynchronous coded slotted ALOHA (FA-CSA) system where
users become active according to a Poisson random process. In contrast to
standard frame-synchronous CSA (FS-CSA), users transmit a first replica of
their message in the slot following their activation and other replicas
uniformly at random in a number of subsequent slots. We derive the
(approximate) density evolution that characterizes the asymptotic performance
of FA-CSA when the frame length goes to infinity. We show that, if users can
monitor the system before they start transmitting, a boundary-effect similar to
that of spatially-coupled codes occurs, which greatly improves the decoding
threshold as compared to FS-CSA. We also derive analytical approximations of
the error floor (EF) in the finite frame length regime. We show that FA-CSA
yields in general lower EF, better performance in the waterfall region, and
lower average delay, as compared to FS-CSA.Comment: 5 pages, 6 figures. Updated notation, terminology, and typo
On Frame Asynchronous Coded Slotted ALOHA: Asymptotic, Finite Length, and Delay Analysis
We consider a frame asynchronous coded slotted ALOHA (FA-CSA) system for
uncoordinated multiple access, where users join the system on a slot-by-slot
basis according to a Poisson random process and, in contrast to standard frame
synchronous CSA (FS-CSA), users are not frame-synchronized. We analyze the
performance of FA-CSA in terms of packet loss rate and delay. In particular, we
derive the (approximate) density evolution that characterizes the asymptotic
performance of FA-CSA when the frame length goes to infinity. We show that, if
the receiver can monitor the system before anyone starts transmitting, a
boundary effect similar to that of spatially-coupled codes occurs, which
greatly improves the iterative decoding threshold. Furthermore, we derive tight
approximations of the error floor (EF) for the finite frame length regime,
based on the probability of occurrence of the most frequent stopping sets. We
show that, in general, FA-CSA provides better performance in both the EF and
waterfall regions as compared to FS-CSA. Moreover, FA-CSA exhibits better delay
properties than FS-CSA.Comment: 13 pages, 12 figures. arXiv admin note: substantial text overlap with
arXiv:1604.0629
Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access
In this paper, a random access scheme is introduced which relies on the
combination of packet erasure correcting codes and successive interference
cancellation (SIC). The scheme is named coded slotted ALOHA. A bipartite graph
representation of the SIC process, resembling iterative decoding of generalized
low-density parity-check codes over the erasure channel, is exploited to
optimize the selection probabilities of the component erasure correcting codes
via density evolution analysis. The capacity (in packets per slot) of the
scheme is then analyzed in the context of the collision channel without
feedback. Moreover, a capacity bound is developed and component code
distributions tightly approaching the bound are derived.Comment: The final version to appear in IEEE Trans. Inf. Theory. 18 pages, 10
figure
Study of coded ALOHA with multi-user detection under heavy-tailed and correlated arrivals
In this paper, we study via simulation the performance of irregular repetition slotted ALOHA under multi-packet detection and different patterns of the load process. On the one hand, we model the arrival process with a version of the M/G/∞ process able to exhibit a correlation structure decaying slowly in time. Given the independence among frames in frame-synchronous coded-slotted ALOHA (CSA), this variation should only take effect on frame-asynchronous CSA. On the other hand, we vary the marginal distribution of the arrival process using discrete versions of the Lognormal and Pareto distributions, with the objective of investigating the influence of the right tail. In this case, both techniques should be affected by the change, albeit to a different degree. Our results confirm these hypotheses and show that these factors must be taken into account when designing and analyzing these systems. In frameless operations, both the shape of the packet arrivals tail distribution and the existence of short-range and long-range correlations strongly impact the packet loss ratio and the average delay. Nevertheless, these effects emerge only weakly in the case of frame-aligned operations, because this enforces the system to introduce a delay in the newly arrived packets (until the beginning of the next frame), and implies that the backlog of accumulated packets is the key quantity for calculating the performance.Ministerio de Ciencia e Innovación | Ref. PID2020-113240RB-I00Ministerio de Ciencia e Innovación | Ref. PID2020-113795RB-C3
Modern Random Access for Satellite Communications
The present PhD dissertation focuses on modern random access (RA) techniques.
In the first part an slot- and frame-asynchronous RA scheme adopting replicas,
successive interference cancellation and combining techniques is presented and
its performance analysed. The comparison of both slot-synchronous and
asynchronous RA at higher layer, follows. Next, the optimization procedure, for
slot-synchronous RA with irregular repetitions, is extended to the Rayleigh
block fading channel. Finally, random access with multiple receivers is
considered.Comment: PhD Thesis, 196 page
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
- …