TY - GEN
T1 - On Design and Analysis of Asynchronous Repetition Slotted ALOHA for Massive Access
AU - Li, Xu
AU - Yang, Tao
AU - Yuan, Xiaojun
AU - Liu, Rongke
AU - Jiang, Fan
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - This paper studies asynchronous repetition slotted ALOHA (a-RSA) for massive random access. Each user's packet is repeated and allocated to randomly selected slots. Then, the users transmit simultaneously and arrive at the base station (BS) receiver with different delays, i.e., without user-synchronization. The BS receiver carries out an over-sampling-based operation, yielding an over-sampled signal space. We develop an iterative soft cancellation detection and decoding that exploits the interference structure of the over-sampled signal for powerful multi-user decoding. Afterwards, packet cancellation for a-RSA is utilized to solve packet collision. To characterize the performance of a-RSA, we analyze the achievable channel parameter region (ACPR) and outage probability. Further, we present an asymptotic analysis of the throughput of a-RSA system. It is demonstrated that the normalized throughput of a-RSA exceeds that of traditional RSA by about 20% ~ 30%.
AB - This paper studies asynchronous repetition slotted ALOHA (a-RSA) for massive random access. Each user's packet is repeated and allocated to randomly selected slots. Then, the users transmit simultaneously and arrive at the base station (BS) receiver with different delays, i.e., without user-synchronization. The BS receiver carries out an over-sampling-based operation, yielding an over-sampled signal space. We develop an iterative soft cancellation detection and decoding that exploits the interference structure of the over-sampled signal for powerful multi-user decoding. Afterwards, packet cancellation for a-RSA is utilized to solve packet collision. To characterize the performance of a-RSA, we analyze the achievable channel parameter region (ACPR) and outage probability. Further, we present an asymptotic analysis of the throughput of a-RSA system. It is demonstrated that the normalized throughput of a-RSA exceeds that of traditional RSA by about 20% ~ 30%.
KW - asynchronous non-orthogonal multiple access
KW - asynchronous repetition slotted ALOHA
KW - massive access
KW - over-sampling
UR - https://www.scopus.com/pages/publications/105029031828
U2 - 10.1109/ITW62417.2025.11240292
DO - 10.1109/ITW62417.2025.11240292
M3 - 会议稿件
AN - SCOPUS:105029031828
T3 - 2025 IEEE Information Theory Workshop, ITW 2025
BT - 2025 IEEE Information Theory Workshop, ITW 2025
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2025 IEEE Information Theory Workshop, ITW 2025
Y2 - 29 September 2025 through 3 October 2025
ER -