ALOHA Random Access that Operates as a Rateless Code

Čedomir Stefanović

doi:10.1109/TCOMM.2013.100913.130232

Return

ALOHA Random Access that Operates as a Rateless Code

2013-11-01

124

Čedomir Stefanović *

Petar Popovski

DOI：10.1109/TCOMM.2013.100913.130232

Original

Save

View PDF

Abstract

En 中文

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 the 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.

Keywords:

Random access protocols

slotted ALOHA

distributed rateless coding

successive interference cancellation

M2M communications

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.