Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian MAC

Anton Glebov, Nikolay Matveev, Kirill Andreev, Alexey Frolov, Andrey Turlikov

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    18 Citations (Scopus)

    Abstract

    We address the problem of uncoordinated massive random-access in the Gaussian multiple access channel (MAC). The performance of low-complexity T-fold irregular repetition slotted ALOHA (IRSA) scheme is investigated and achievability bounds are derived. The main difference of this scheme in comparison to IRSA is as follows: any collisions of order up to T can be resolved with some probability of error introduced by noise. In order to optimize the parameters of the scheme we combine the density evolution method (DE) proposed by G. Liva and a finite length random coding bound for the Gaussian MAC proposed by Y. Polyanskiy. As energy efficiency is of critical importance for massive machine-type communication (mMTC), then our main goal is to minimize the energy-per-bit required to achieve the target packet loss ratio (PLR). We consider two scenarios: (a) the number of active users is fixed; (b) the number of active users is a Poisson random variable.

    Original languageEnglish
    Title of host publication2019 IEEE Wireless Communications and Networking Conference, WCNC 2019
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    ISBN (Electronic)9781538676462
    DOIs
    Publication statusPublished - Apr 2019
    Event2019 IEEE Wireless Communications and Networking Conference, WCNC 2019 - Marrakesh, Morocco
    Duration: 15 Apr 201919 Apr 2019

    Publication series

    NameIEEE Wireless Communications and Networking Conference, WCNC
    Volume2019-April
    ISSN (Print)1525-3511

    Conference

    Conference2019 IEEE Wireless Communications and Networking Conference, WCNC 2019
    Country/TerritoryMorocco
    CityMarrakesh
    Period15/04/1919/04/19

    Fingerprint

    Dive into the research topics of 'Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian MAC'. Together they form a unique fingerprint.

    Cite this