Massive Random Access with Common Alarm Messages
read the original abstract
The established view on massive IoT access is that the IoT devices are activated randomly and independently. This is a basic premise also in the recent information-theoretic treatment of massive access by Polyanskiy. In a number of practical scenarios, the information from IoT devices in a given geographical area is inherently correlated due to a commonly observed physical phenomenon. We introduce a model for massive access that accounts for correlation both in device activation and in the message content. To this end, we introduce common alarm messages for all devices. A physical phenomenon can trigger an alarm causing a subset of devices to transmit the same message at the same time. We develop a new error probability model that includes false positive errors, resulting from decoding a non-transmitted codeword. The results show that the correlation allows for high reliability at the expense of spectral efficiency. This reflects the intuitive trade-off: an access from a massive number can be ultra-reliable only if the information across the devices is correlated.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Energy efficient coded random access for the wireless uplink
Provides achievability bounds for random access over Rayleigh fading and shows that a practical sparse-graph code with alternating BP decoder performs close to the bounds, with a phase transition enabling perfect inte...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.