A perspective on massive random-access

By Yury Polyanskiy. International Symposium on Information Theory, 2017

475 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/0f4fb05760e8cbe682fc03fbe7e1e419d44fa24f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Robert Schober
2. Erik G. Larsson
3. Wei Yu
4. Derrick Wing Kwan Ng
5. Naofal Al-Dhahir
6. Mohammad Mahdi Azari
7. Rana Abbas
8. Amin Azari

In Electrical and Electronic Engineering

1. Robert Schober
2. Derrick Wing Kwan Ng
3. Rui Zhang
4. Naofal Al-Dhahir
5. Erik G. Larsson
6. Wei Yu
7. Petar Popovski
8. Xiaoming Chen

Citations in the corpus

• Compressive Sensing-Based Adaptive Active User Detection and Channel Estimation: Massive Access Meets Massive MIMO (2019, background): “Furthermore, the massive access problem with sparse user activity has also been studied from an information-theoretical perspective [25], [26].”
• Grant-Free Non-Orthogonal Multiple Access for IoT: A Survey (2019, methodology): “A destination is free to determine which linear equation to recover [148].”
• Massive Access for 5G and Beyond (2020, background): “Moreover, a new random access protocol called unsourced massive random access has been proposed recently [58].”
• Cellular, Wide-Area, and Non-Terrestrial IoT: A Survey on 5G Advances and the Road Toward 6G (2021, background): “3) Unsourced random access: Unsourced multiple access channel is referred to the multiple access problem introduced by Polyanskiy in [257].”