Compressive Massive Random Access for Massive Machine-Type Communications (mMTC)
arXiv:1809.03784
Abstract
In future wireless networks, one fundamental challenge for massive machine-type communications (mMTC) lies in the reliable support of massive connectivity with low latency. Against this background, this paper proposes a compressive sensing (CS)-based massive random access scheme for mMTC by leveraging the inherent sporadic traffic, where both the active devices and their channels can be jointly estimated with low overhead. Specifically, we consider devices in the uplink massive random access adopt pseudo random pilots, which are designed under the framework of CS theory. Meanwhile, the massive random access at the base stations (BS) can be formulated as the sparse signal recovery problem by leveraging the sparse nature of active devices. Moreover, by exploiting the structured sparsity among different receiver antennas and subcarriers, we develop a distributed multiple measurement vector approximate message passing (DMMV-AMP) algorithm for further improved performance. Additionally, the state evolution (SE) of the proposed DMMV-AMP algorithm is derived to predict the performance. Simulation results demonstrate the superiority of the proposed scheme, which exhibits a good tightness with the theoretical SE.
arXiv commentThis paper has been accepted by 2018 IEEE GlobalSIP
References in corpus (6)
- Massive Machine-type Communications in 5G: Physical and MAC-layer solutions
- Massive Connectivity with Massive MIMO-Part I: Device Activity Detection and Channel Estimation
- Spatially Common Sparsity Based Adaptive Channel Estimation and Feedback for FDD Massive MIMO
- A Random Access Protocol for Pilot Allocation in Crowded Massive MIMO Systems
- Grant-free Rateless Multiple Access: A Novel Massive Access Scheme for Internet of Things
- Approximate Message Passing with Nearest Neighbor Sparsity Pattern Learning