Random Multiple Access for M2M Communications with QoS Guarantees

TL;DR

This paper introduces a novel random multiple access scheme with QoS guarantees for M2M communications, utilizing group-based access probabilities and successive interference cancellation to improve reliability and energy efficiency.

Contribution

It proposes a new RMA scheme with optimized access probabilities for QoS guarantees in M2M, validated through analytical expressions and simulations.

Findings

Achieves high reliability and energy efficiency in M2M access.

Outperforms standard coordinated and recent M2M access schemes.

Provides closed-form expressions for device resolution probability.

Abstract

We propose a novel random multiple access (RMA) scheme with quality of service (QoS) guarantees for machine-to-machine (M2M) communications. We consider a slotted uncoordinated data transmission period during which machine type communication (MTC) devices transmit over the same radio channel. Based on the latency requirements, MTC devices are divided into groups of different sizes, and the transmission frame is divided into subframes of different lengths. In each subframe, each group is assigned an access probability based on which an MTC device decides to transmit replicas of its packet or remain silent. The base station (BS) employs successive interference cancellation (SIC) to recover all the superposed packets. We derive the closed form expressions for the average probability of device resolution for each group, and we use these expressions to design the access probabilities. The accuracy of the expressions is validated through Monte Carlo simulations. We show that the designed access probabilities can guarantee the QoS requirements with high reliability and high energy efficiency. Finally, we show that RMA can outperform standard coordinated access schemes as well as some of the recently proposed M2M access schemes for cellular networks.