Frameless ALOHA Protocol for Wireless Networks
arXiv:1205.4208 · doi:10.1109/LCOMM.2012.101712.121073
Abstract
We propose a novel distributed random access scheme for wireless networks based on slotted ALOHA, motivated by the analogies between successive interference cancellation and iterative belief-propagation decoding on erasure channels. The proposed scheme assumes that each user independently accesses the wireless link in each slot with a predefined probability, resulting in a distribution of user transmissions over slots. The operation bears analogy with rateless codes, both in terms of probability distributions as well as to the fact that the ALOHA frame becomes fluid and adapted to the current contention process. Our aim is to optimize the slot access probability in order to achieve rateless-like distributions, focusing both on the maximization of the resolution probability of user transmissions and the throughput of the scheme.
To appear in IEEE Communications Letters
References in corpus (1)
Cited by in corpus (25)
- Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access
- Coded Random Access: Applying Codes on Graphs to Design Random Access Protocols
- DNN-Aided Block Sparse Bayesian Learning for User Activity Detection and Channel Estimation in Grant-Free Non-Orthogonal Random Access
- Enhancing Contention Resolution ALOHA using Combining Techniques
- Exploiting Capture Effect in Frameless ALOHA for Massive Wireless Random Access
- Low-Rate Machine-Type Communication via Wireless Device-to-Device (D2D) Links
- Ultra-Reliable Communication in 5G Wireless Systems
- Coded Pilot Access: A Random Access Solution for Massive MIMO Systems
- A Survey: Non-Orthogonal Multiple Access with Compressed Sensing Multiuser Detection for mMTC
- Finite-Length Analysis of Frameless ALOHA
- Grant-Free Massive NOMA: Outage Probability and Throughput
- Fixed-Symbol Aided Random Access Scheme for Machine-to-Machine Communications
- Detection and Combining Techniques for Asynchronous Random Access with Time Diversity
- Characterization of Coded Random Access with Compressive Sensing based Multi-User Detection
- Modern Random Access for Satellite Communications
- On the Capacity Region of ALOHA Protocol for the Internet of Things
- Identifying Randomly Activated Users via Sign-Compute-Resolve on Graphs
- Coding for Network-Coded Slotted ALOHA
- Random Multiple Access for M2M Communications with QoS Guarantees
- Slotted Aloha for Networked Base Stations
- Cooperative Slotted Aloha for Multi-Base Station Systems
- The Throughput of Slotted Aloha with Diversity
- Finite-Length Analysis of Frameless ALOHA with Multi-User Detection
- ALOHA Random Access that Operates as a Rateless Code
- Hard Latency-Constraints for High-Throughput Random Access: SICQTA