Deterministic Patterns for Multiple Access with Latency and Reliability Guarantees
arxiv(2022)
摘要
We study a scenario in which multiple uncoordinated devices aim to achieve
reliable transmissions within a given time frame. The devices are
intermittently active and access a shared pool of channel resources in a
grant-free manner by utilizing multiple transmissions (K-repetition coding).
This allows them to achieve diversity and improve the reliability within a
certain latency constraint. We focus on two access methods: one where devices
choose K slots at random and another one where the access patterns are
deterministic and follow a specific code design, namely the Steiner System. We
analyze the problem under two signal models that involve different complexity
for the receiver. First, collision model is considered, where only
interference-free transmissions can be used and combined. Second, a model
treating interference as noise is analyzed, where the receiver is capable of
utilizing all K replicas, applying maximum ratio combining (MRC). For both
signal models, we investigate receivers with and without successive
interference cancellation (SIC). We develop approximations and bounds for the
outage probabilities that very closely match simulation results. Overall, we
show that deterministic access patterns have the potential to significantly
outperform random selection in terms of reliability. Furthermore, deterministic
access patterns offer a simplified system design.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要