返回
Theoretical Throughput Analysis for Massive Random Access With Spatial Successive Decoding
DOI:10.1109/TVT.2020.2992677.png)
摘要
En 中文
A key challenge of enabling massive machine type communications (mMTC) is to support infrequent small data transmission from a large number of machine type devices (MTDs). Random access with spatial successive decoding allows a packet to be received by multiple receivers and decoded with successive interference cancellation (SIC) across receivers, increasing not only throughput but also reliability, which is a promising random access protocol for mMTC. However, its theoretical throughput analysis is still an open issue. To address this issue, an innovative bipartite graph based throughput analysis framework is proposed in this paper, in which multiple receivers serve as sum nodes, active users serve as burst nodes, independent on-off fading channels are used to model edges connecting sum nodes and burst nodes. With this bipartite graph representation, an and-or tree iteration with binomial distributed node perspective degree distribution is formalized to evaluate the asymptotic throughput of random access with spatial successive decoding. Moreover, as a byproduct theorem, an alternative simplified proof is given to derive the analytical throughput of random access with spatial diversity but without successive decoding. Comprehensive numerical results are provided to illustrate their critical performance characteristics and verify the advantages of including spatial diversity and successive decoding for random access.
Keyword:
Throughput
Receivers
Decoding
Bipartite graph
Spatial diversity
Silicon carbide
Fading channels
Massive random access
spatial diversity
successive decoding
bipartite graph
throughput analysis
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.1
论文数:
1.8W
被引数:
6.6W
机构
引用论文
Wolfe mammographic parenchymal patterns. A study of the masking hypothesis of Egan and Mosteller
Cancer
IF0

