Sparse Message Passing Based Preamble Estimation for Crowded M2M Communications

TL;DR

This paper introduces a sparse message passing algorithm that improves preamble detection and resource efficiency in crowded M2M communications by accurately estimating device activity and preamble choices.

Contribution

The paper proposes a novel SMP algorithm based on factor graphs for preamble estimation, addressing collision issues in massive M2M scenarios.

Findings

Significant reduction in estimation error rate.

Improved resource block efficiency during data transmission.

Validated analytical model matches simulation results.

Abstract

Due to the massive number of devices in the M2M communication era, new challenges have been brought to the existing random-access (RA) mechanism, such as severe preamble collisions and resource block (RB) wastes. To address these problems, a novel sparse message passing (SMP) algorithm is proposed, based on a factor graph on which Bernoulli messages are updated. The SMP enables an accurate estimation on the activity of the devices and the identity of the preamble chosen by each active device. Aided by the estimation, the RB efficiency for the uplink data transmission can be improved, especially among the collided devices. In addition, an analytical tool is derived to analyze the iterative evolution and convergence of the SMP algorithm. Finally, numerical simulations are provided to verify the validity of our analytical results and the significant improvement of the proposed SMP on estimation error rate even when preamble collision occurs.