Fixed-Symbol Aided Random Access Scheme for Machine-to-Machine Communications

Abstract

The massiveness of devices in crowded Machine-to-Machine (M2M) communications brings new challenges to existing random-access (RA) schemes, such as heavy signaling overhead and severe access collisions. In order to reduce the signaling overhead, we propose a fixed-symbol aided RA scheme where active devices access the network in a grant-free method, i.e., data packets are directly transmitted in randomly chosen slots. To further address the access collision which impedes the activity detection, one fixed symbol is inserted into each transmitted data packet in the proposed scheme. An iterative message passing based activity detection (MP-AD) algorithm is performed upon the received signal of this fixed symbol to detect the device activity in each slot. In addition, the deep neural network-aided MP-AD (DNN-MP-AD) algorithm is further designed to alleviate the correlation problem of the iterative message passing process. In the DNN-MP-AD algorithm, the iterative message passing process is transferred from a factor graph to a DNN. Weights are imposed on the messages in the DNN and further trained to improve the accuracy of the device activity detection. Finally, numerical simulations are provided for the throughput of the proposed RA scheme, the accuracy of the proposed MP-AD algorithm, as well as the improvement brought by the DNN-MP-AD algorithm.

arXiv comment15 pages, 9 figures

References in corpus (11)

• Message Passing Algorithms for Compressed Sensing
• Massive Connectivity with Massive MIMO-Part I: Device Activity Detection and Channel Estimation
• Deep Learning Methods for Improved Decoding of Linear Codes
• Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access
• Massive Connectivity with Massive MIMO-Part II: Achievable Rate Characterization
• Frameless ALOHA Protocol for Wireless Networks
• Convergence Analysis and Assurance for Gaussian Message Passing Iterative Detector in Massive MU-MIMO Systems
• Spatially-Coupled Random Access on Graphs
• Gaussian Belief Propagation Based Multiuser Detection
• Optimal deep neural networks for sparse recovery via Laplace techniques
• Sparse Message Passing Based Preamble Estimation for Crowded M2M Communications

Cited by in corpus (2)

• DNN-Aided Block Sparse Bayesian Learning for User Activity Detection and Channel Estimation in Grant-Free Non-Orthogonal Random Access
• User Activity Detection and Channel Estimation for Grant-Free Random Access in LEO Satellite-Enabled Internet-of-Things