Blind Goal-Oriented Massive Access for Future Wireless Networks

@article{Daei2022BlindGM,
  title={Blind Goal-Oriented Massive Access for Future Wireless Networks},
  author={Sajad Daei and Marios Kountouris},
  journal={ArXiv},
  year={2022},
  volume={abs/2205.07092}
}
—Emerging communication networks are envisioned to support massive wireless connectivity of heterogeneous devices with sporadic traffic and diverse requirements in terms of latency, reliability, and bandwidth. Providing multiple access to an increasing number of uncoordinated users and sharing the limited resources become essential in this context. In this work, we revisit the random access (RA) problem and exploit the continuous angular group sparsity feature of wireless channels to propose a… 

Figures from this paper

Demixing Sines and Spikes Using Multiple Measurement Vectors

References

SHOWING 1-10 OF 45 REFERENCES

Sparse Signal Processing for Grant-Free Massive Connectivity: A Future Paradigm for Random Access Protocols in the Internet of Things

It is argued that massive multiple-input, multiple-output (MIMO) is especially well suited for massive IoT connectivity because the device detection error can be driven to zero asymptotically in the limit as the number of antennas at the base station (BS) goes to infinity by using the multiplemeasurement vector (MMV) compressed sensing techniques.

Massive Unsourced Random Access: Exploiting Angular Domain Sparsity

This paper investigates the unsourced random access (URA) scheme to accommodate numerous machine-type users communicating to a base station equipped with multiple antennas and proposes an expectation-maximization-aided generalized approximate message passing algorithm with a Markov random field support structure that captures the inherent clustered sparsity structure of the angular domain channel.

A Random Access Protocol for Pilot Allocation in Crowded Massive MIMO Systems

This paper revisits the random access problem in the Massive MIMO context and develops a reengineered protocol, termed strongest-user collision resolution (SUCRe), which resolves the vast majority of all pilot collisions in crowded urban scenarios and continues to admit UEs efficiently in overloaded networks.

Active User Detection and Channel Estimation for Spatial-Based Random Access in Crowded Massive MIMO Systems via Blind Super-Resolution

A blind clustering algorithm based on super-resolution techniques that not only detects the spatial features of the active users but also provides accurate channel estimation is proposed that provides a high performance spatial-based RA in crowded massive MIMO systems.

RRH based massive MIMO with “on the Fly” pilot contamination control

A novel coded pilot approach is introduced, which allows each RRH unit to detect pilot collisions, and can yield densification benefits in the form of increased multiplexing gains per UL pilot dimension with respect to conventional reuse schemes and some recent approaches assigning pseudorandom pilot vectors to the active users.

Massive Connectivity With Massive MIMO—Part I: Device Activity Detection and Channel Estimation

  • Liang LiuWei Yu
  • Computer Science
    IEEE Transactions on Signal Processing
  • 2018
It is shown that in the asymptotic massive multiple-input multiple-output regime, both the missed device detection and the false alarm probabilities for activity detection can always be made to go to zero by utilizing compressed sensing techniques that exploit sparsity in the user activity pattern.

Grant-Free Massive MTC-Enabled Massive MIMO: A Compressive Sensing Approach

An algorithm is designed that jointly detects device activity along with embedded information bits and exploits the structured sparsity introduced by the non-coherent transmission scheme and has superior performance compared with application of the original AMP approach.

Massive Connectivity With Massive MIMO—Part II: Achievable Rate Characterization

  • Liang LiuWei Yu
  • Computer Science
    IEEE Transactions on Signal Processing
  • 2018
This paper characterizes each active user's achievable rate using random matrix theory under either maximal-ratio combining (MRC) or minimum mean-squared error (MMSE) receive beamforming at the base station (BS), assuming the statistics of their estimated channels as derived in Part I.

Massive MIMO Unsourced Random Access

A novel non-Bayesian `activity detection' algorithm for massive MIMO random access channels, that outperforms currently proposed Bayesian vector AMP (VAMP) schemes currently proposed for activity detection, and does not suffer from the numerical instabilities and requirement for accurate a priori statistics as VAMP.

Joint User Identification and Channel Estimation via Exploiting Spatial Channel Covariance in mMTC

This work proposes a method based on alternating direction method of multipliers to solve the JUICE efficiently and shows that the proposed method significantly improves the user identification accuracy and channel estimation performance with lower signalling overhead as compared to the baseline schemes.