An Achievability Bound of Energy per Bit for Stabilized Massive Random Access Gaussian Channel

Artem Burkov, Seva Shneer, Andrey Turlikov

Research output: Contribution to journalArticlepeer-review

49 Downloads (Pure)

Abstract

Developing communication standards highlight a scenario called massive Machine-Type Communication within the framework of the Internet of Things. Under this scenario, a large number of devices with autonomous power supplies will operate in a random multiple access mode. It is crucial to keep the system stable, while consuming minimal energy. We describe a model of a system with a Gaussian Random Access Channel and consider an algorithm allowing message retransmissions. We provide a stability condition for the system and introduce an optimization problem to determine an achievability bound for energy per bit.
Original languageEnglish
Pages (from-to)299-302
Number of pages4
JournalIEEE Communications Letters
Volume25
Issue number1
Early online date11 Sept 2020
DOIs
Publication statusPublished - Jan 2021

Fingerprint

Dive into the research topics of 'An Achievability Bound of Energy per Bit for Stabilized Massive Random Access Gaussian Channel'. Together they form a unique fingerprint.

Cite this