Papers
Topics
Authors
Recent
2000 character limit reached

Semi-Grant-Free NOMA: A Stochastic Geometry Model

Published 23 Jun 2020 in cs.IT and math.IT | (2006.13286v1)

Abstract: Grant-free (GF) transmission holds promise in terms of low latency communication by directly transmitting messages without waiting for any permissions. However, collision situations may frequently happen when limited spectrum is occupied by numerous GF users. The non-orthogonal multiple access (NOMA) technique can be a promising solution to achieve massive connectivity and fewer collisions for GF transmission by multiplexing users in power domain. We utilize a semi-grant-free (semi-GF) NOMA scheme for enhancing network connectivity and spectral efficiency by enabling grant-based (GB) and GF users to share the same spectrum resources. With the aid of semi-GF protocols, uplink NOMA networks are investigated by invoking stochastic geometry techniques. We propose a novel \textit{dynamic protocol} to interpret which part of the GF users are paired in NOMA transmissions via transmitting various channel quality thresholds by an added handshake. We utilize open-loop protocol with a fixed average threshold as the benchmark to investigate performance improvement. It is observed that dynamic protocol provides more accurate channel quality thresholds than open-loop protocol, thereby the interference from the GF users is reduced to a large extent. We analyze the outage performance and diversity gains under two protocols. Numerical results demonstrate that dynamic protocol is capable of enhancing the outage performance than open-loop protocol.

Citations (30)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.