Coded Random Access Schemes for Critical mMTC With Multiple Latency Deadlines
Alessandro Mirri, Lorenzo Valentini, Israel Leyva‐Mayorga, Marco Chiani, Enrico Paolini, Petar Popovski · IEEE Transactions on Communications · 2025
We introduce a massive multiple access scheme designed to meet different trade-offs between reliability, scalability, and latency. To maximize the number of successfully decoded users, the scheme builds upon coded random access, incorporating both grant-free and grant-based procedures, along with a massive acknowledgment phase conducted at the base station. The main design premise is the establishment of two distinct latency deadlines: the first one guaranteeing high reliability (e.g., between 99% and 99.99%), and the second one enforcing ultra-high reliability, even above 99.9999%. This dual-latency approach, supplemented with massive MIMO, enables the system to support a higher number of active users per frame while meeting stringent reliability requirements. Throughout the paper, we present a theoretical analysis and derive performance bounds to guide and support effective system design. The approach opens the door for the development of critical services that bridge the gap between massive machine-type communication (mMTC) and ultra-reliable and low-latency communication (URLLC), providing a more flexible and efficient framework for next-generation systems.