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

摘要

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.