论文标题
具有延迟和可靠性保证的多次访问的确定性模式
Deterministic Patterns for Multiple Access with Latency and Reliability Guarantees
论文作者
论文摘要
我们研究了一种场景,其中多个不协调的设备旨在在给定时间范围内实现可靠的传输。这些设备间歇性地活跃,并通过使用多个传输(K-重复编码),以免赠款方式访问共享的渠道资源池。这使他们能够实现多样性并提高一定延迟限制内的可靠性。我们专注于两种访问方法:一种设备随机选择k插槽,另一个设备选择访问模式是确定性的,并遵循特定的代码设计,即Steiner系统。我们分析了两个信号模型下的问题,该问题涉及接收器的复杂性不同。首先,考虑碰撞模型,仅可以使用和组合无干扰的传输。其次,分析了将干扰视为噪声的模型,其中接收器能够利用所有k复制品,应用最大比率组合(MRC)。对于这两个信号模型,我们都会调查有或没有连续干扰取消(SIC)的接收器。我们为与模拟结果非常匹配的中断概率开发近似和边界。总体而言,我们表明确定性访问模式有可能在可靠性方面显着胜过随机选择。此外,确定性访问模式提供了简化的系统设计。
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.