Achievability Bounds for Massive Random Access in the Gaussian MAC with Delay Constraints

Artem Burkov, Alexey Frolov, Pavel Rybin, Andrey Turlikov

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

    Abstract

    We are considering the problem of uncoordinated massive random access in the Gaussian multiple access channel (MAC). The energy efficiency of the ALOHA type algorithm with the immediate transfer and without confirmation is investigated. We determine the achievability bound for the consumed energy-per-bit, taking into account target Packet Delivery Ratio (PDR) and the constraint on Packet Delivery Delay(PDD). To analyze the performance of the system we use a finite length random coding bound for the Gaussian MAC proposed by Y. Polyanskiy.

    Original languageEnglish
    Title of host publication2019 16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages224-227
    Number of pages4
    ISBN (Electronic)9781728119441
    DOIs
    Publication statusPublished - Oct 2019
    Event16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019 - Moscow, Russian Federation
    Duration: 21 Oct 201925 Oct 2019

    Publication series

    Name2019 16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019

    Conference

    Conference16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019
    Country/TerritoryRussian Federation
    CityMoscow
    Period21/10/1925/10/19

    Keywords

    • achievability bound
    • energy-per-bit
    • packet delivery delay
    • packet delivery ratio
    • random multiple access

    Fingerprint

    Dive into the research topics of 'Achievability Bounds for Massive Random Access in the Gaussian MAC with Delay Constraints'. Together they form a unique fingerprint.

    Cite this