Ultra-Reliable Short Message Cooperative Relaying Protocols under Nakagami-m Fading
Parisa Nouri, Hirley Alves, Richard Demo Souza, and Matti Latva-aho

TL;DR
This paper analyzes ultra-reliable short message transmission using cooperative relaying protocols under Nakagami-m fading, demonstrating improved performance over direct transmission in finite blocklength regimes for future low-latency wireless systems.
Contribution
It introduces and compares two cooperative relaying protocols for uMTC, providing closed-form outage probability expressions under Nakagami-m fading and analyzing their performance impacts.
Findings
Cooperative relaying outperforms direct transmission in outage probability.
Fading severity and power allocation significantly affect reliability.
Closed-form outage probability expressions are derived for the protocols.
Abstract
In the next few years, the development of wireless communication systems propel the world into a fully connected society where the Machine-type Communications (MTC) plays a substantial role as key enabler in the future cellular systems. MTC is categorized into mMTC and uMTC, where mMTC provides the connectivity to massive number of devices while uMTC is related to low latency and ultra-high reliability of the wireless communications. This paper studies uMTC with incremental relaying technique, where the source and relay collaborate to transfer the message to a destination. In this paper, we compare the performance of two distinct cooperative relaying protocols with the direct transmission under the finite blocklength (FB) regime. We define the overall outage probability in each relaying scenario, supposing Nakagami-m fading. We show that cooperative communication outperforms direct…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
