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

Artem Burkov; Seva Shneer; Andrey Turlikov

doi:10.1109/LCOMM.2020.3023461

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

Artem Burkov
, Seva Shneer
, Andrey Turlikov

Research output: Contribution to journal › Article › peer-review

99 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 language	English
Pages (from-to)	299-302
Number of pages	4
Journal	IEEE Communications Letters
Volume	25
Issue number	1
Early online date	11 Sept 2020
DOIs	https://doi.org/10.1109/LCOMM.2020.3023461
Publication status	Published - Jan 2021

Access to Document

10.1109/LCOMM.2020.3023461

Download pdf
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Accepted author manuscript, 251 KB

Cite this

@article{5db6fd9f097d4ed289d7e1191dea1cf5,

title = "An Achievability Bound of Energy per Bit for Stabilized Massive Random Access Gaussian Channel",

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.",

author = "Artem Burkov and Seva Shneer and Andrey Turlikov",

year = "2021",

month = jan,

doi = "10.1109/LCOMM.2020.3023461",

language = "English",

volume = "25",

pages = "299--302",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "IEEE",

number = "1",

}

TY - JOUR

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

AU - Burkov, Artem

AU - Shneer, Seva

AU - Turlikov, Andrey

PY - 2021/1

Y1 - 2021/1

N2 - 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.

AB - 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.

U2 - 10.1109/LCOMM.2020.3023461

DO - 10.1109/LCOMM.2020.3023461

M3 - Article

SN - 1089-7798

VL - 25

SP - 299

EP - 302

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 1

ER -

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

Abstract

Access to Document

Fingerprint

Cite this