Random access on graphs: A survey and new results

Various applications of wireless Machine-to-Machine (M2M) communications have rekindled the research interest in random access protocols, suitable to support a large number of connected devices. Slotted ALOHA and its derivatives represent a simple solution for distributed random access in wireless networks. Recently, a framed version of slotted ALOHA gained renewed interest due to the incorporation of successive interference cancellation (SIC) in the scheme, which resulted in substantially higher throughputs. Based on similar principles and inspired by the rateless coding paradigm, a frameless approach for distributed random access in slotted ALOHA framework is described in this paper. The proposed approach shares an operational analogy with rateless coding, expressed both through the user access strategy and the adaptive length of the contention period, with the objective to end the contention when the instantaneous throughput is maximized. The paper presents the related analysis, providing heuristic criteria for terminating the contention period and showing that very high throughputs can be achieved, even for a low number for contending users. The demonstrated results potentially have more direct practical implications compared to the approaches for coded random access that lead to high throughputs only asymptotically.Index Terms-random access protocols, slotted ALOHA, distributed rateless coding, successive interference cancellation, M2M communications 1 The idea of users transmitting multiple replicas of the same data in the frame, but without SIC, was originally proposed in [4].

show abstract

“…A related remark was pointed out in[17], by noting that the number of repeated user transmissions in the frame increases as N increases.…”

mentioning

confidence: 65%

ALOHA Random Access that Operates as a Rateless Code

Stefanović

Popovski

2013

IEEE Trans. Commun.

151

View full text Add to dashboard Cite

show abstract

“…Collisions can greatly degrade the system performance of SA, in particular, the (system) throughput. To improve the throughput of SA, various approaches that exploit the diversity gains, including the spatial diversity and the temporal diversity, were proposed in the literature (see, e.g., the surveys [2]- [5]).…”

Section: Introductionmentioning

confidence: 99%

“…The and-or tree evaluation method in [2], [9], [10], [15] is an iterative decoding method on a random bipartite graph, where one side of nodes uses the AND-gate to decode incoming edges and the other side of nodes uses the ORgate to decode incoming edges. By iteratively tracking the evolution of the probability that an incoming edge can be decoded, the and-or tree evaluation method then derives a limit on the probability that an incoming edge can be decoded.…”

Section: Introductionmentioning

confidence: 99%

“…Such a tree evaluation method tracks the evolution of the densities of the symbols in an LDPC code, and it is known as the density evolution (DE) method. However, the tree evaluation method in [2], [9], [15] only works on a single (tree-like) bipartite graph. In a CSA system with multiple cooperative receivers, the decoding process can no longer be modelled by a single bipartite graph.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Poisson Receivers: a Probabilistic Framework for Analyzing Coded Random Access

Yu,

Huang,

Chang

et al. 2020

Preprint

View full text Add to dashboard Cite

In this paper, we develop a probabilistic framework for analyzing coded random access. Our framework is based on a new abstract receiver (decoder), called a Poisson receiver, that is characterized by a success probability function of a tagged packet subject to a Poisson offered load. We show that various coded slotted ALOHA (CSA) systems are Poisson receivers. Moreover, Poisson receivers have two elegant closure properties: (i) Poisson receivers with packet routing are still Poisson receivers, and (ii) Poisson receivers with packet coding are still Poisson receivers. These two closure properties enable us to use smaller Poisson receivers as building blocks for analyzing a larger Poisson receiver.As such, we can analyze complicated systems that are not possible by the classical tree evaluation method. In particular, for CSA systems with both spatial diversity and temporal diversity, we can use the framework of Poisson receivers to compute the exact (asymptotic) throughput. We demonstrate that our framework can be used to provide differentiated services between ultra-reliable low-latency communication (URLLC) traffic and enhanced mobile broadband (eMBB) traffic. By conducting extensive simulations, we also verify that our theoretical results match extremely well with the simulation results.

show abstract

“…Using packet coding to increase system throughput has been widely addressed in the literature, see, e.g., [5]- [8], [10], [32], [33]. The basic idea is to send a packet multiple times.…”

Section: Poisson Receivers a Review Of The Framework Of Poisson Recei...mentioning

confidence: 99%

ALOHA Receivers: a Network Calculus Approach for Analyzing Coded Multiple Access with SIC

Liu¹,

Yu²,

Lin³

et al. 2020

Preprint

View full text Add to dashboard Cite

Motivated by the need to hide the complexity of the physical layer from performance analysis in a layer 2 protocol, a class of abstract receivers, called Poisson receivers, was recently proposed in [1] as a probabilistic framework for providing differentiated services in uplink transmissions in 5G networks. In this paper, we further propose a deterministic framework of ALOHA receivers that can be incorporated into the probabilistic framework of Poisson receivers for analyzing coded multiple access with successive interference cancellation. An ALOHA receiver is characterized by a success function of the number of packets that can be successfully received. Inspired by the theory of network calculus, we derive various algebraic properties for several operations on success functions and use them to prove various closure properties of ALOHA receivers, including (i) ALOHA receivers in tandem, (ii) cooperative ALOHA receivers, (iii) ALOHA receivers with traffic multiplexing, and (iv) ALOHA receivers with packet coding. By conducting extensive simulations, we show that our theoretical results match extremely well with the simulation results.

show abstract

Random access on graphs: A survey and new results

Cited by 11 publications

References 27 publications

ALOHA Random Access that Operates as a Rateless Code

ALOHA Random Access that Operates as a Rateless Code

Poisson Receivers: a Probabilistic Framework for Analyzing Coded Random Access

ALOHA Receivers: a Network Calculus Approach for Analyzing Coded Multiple Access with SIC

Contact Info

Product

Resources

About