Irregular repetition slotted Aloha with multiuser detection: A density evolution analysis

• Published in: Computer networks (Amsterdam, Netherlands : 1999) Vol. 234; p. 109921
• Main Authors: Fernández-Veiga, Manuel, Sousa-Vieira, M.E., Fernández-Vilas, Ana, Díaz-Redondo, Rebeca P.
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.10.2023
• Subjects: Coded slotted Aloha; Density evolution; Multiuser detection; Multiuser detection; Coded slotted Aloha; Density evolution
• ISSN: 1389-1286; 1872-7069
• DOI: 10.1016/j.comnet.2023.109921

Irregular repetition slotted Aloha (IRSA) has shown significant advantages as a modern technique for uncoordinated random access with massive number of users due to its capability of achieving theoretically a throughput of 1 packet per slot. When the receiver has also the multi-packet reception of multi-user (MUD) detection property, by applying successive interference cancellation, IRSA also obtains very low packet loss probabilities at low traffic loads, but is unable in general to achieve a normalized throughput close to 1. In this paper, we reconsider the case of IRSA with k-MUD receivers and derive the general density evolution equations for the non-asymptotic analysis of the packet loss rate, for arbitrary frame lengths and two operational variants: frame-structured and frameless transmissions. The first one defers transmission attempts until the beginning of the next frame of slots, while the second allows transmission immediately after a packet arrival. Next, using the potential function, we give new capacity bounds on the capacity of the system, showing the threshold arrival rate for zero decoding error probability. Our numerical results illustrate performance in terms of throughput and average delay for k-MUD IRSA with finite memory at the receiver, and also with bounded maximum delay.