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 - 2020/9/11
Y1 - 2020/9/11
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
JO - IEEE Communications Letters
JF - IEEE Communications Letters
SN - 1089-7798
ER -