Recent information-theoretic studies have resulted in several interference management (IM) techniques that promise significant capacity improvements over interference avoidance techniques. However, in practice, the stable throughput region is a more relevant metric compared to the capacity region. In this work, we focus on the stable throughput region of a two-pair intermittent interference network with distributed transmitters and propose a queue-based transmission protocol in different regimes to handle the data between queues. In this context, we translate physical-layer IM protocols to accommodate stochastic message arrivals. To evaluate our proposed techniques, we compare the stable throughput region to the capacity region and show, through simulations, that the stable throughput region matches the capacity region when the latter is known. We show that in order to achieve the optimal stable throughput region, new ingredients are needed when compared to prior results. We quantify the trade-off between encoding/decoding complexity of the proposed scheme (in terms of number of required algebraic operations), and the achievable rates. Finally, we study the lifetime of messages (i.e. the duration from arrival to successful delivery) versus the total communication time, and we observe that the average lifetime scales as the square root of the total communication time.

中文翻译：

---

间歇干扰网络的稳定域


最近的信息论研究已经产生了几种干扰管理（IM）技术，这些技术有望比干扰避免技术显着提高容量。然而，实际上，与容量区域相比，稳定吞吐量区域是一个更相关的指标。在这项工作中，我们关注具有分布式发射机的两对间歇干扰网络的稳定吞吐量区域，并提出了一种不同机制下的基于队列的传输协议来处理队列之间的数据。在这种情况下，我们转换物理层 IM 协议以适应随机消息到达。为了评估我们提出的技术，我们将稳定吞吐量区域与容量区域进行比较，并通过模拟表明，当容量区域已知时，稳定吞吐量区域与容量区域相匹配。我们表明，与之前的结果相比，为了实现最佳的稳定吞吐量区域，需要新的成分。我们量化了所提出方案的编码/解码复杂性（就所需代数运算的数量而言）和可实现的速率之间的权衡。最后，我们研究消息的生命周期（即从到达到成功传递的持续时间）与总通信时间的关系，我们观察到平均生命周期与总通信时间的平方根成正比。