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 the 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) vis-a-vis the total communication time, and we observe that the average lifetime scales as the square root of the total communication time.
翻译:最近的信息理论研究产生了几种干扰管理技术,这些技术有望显著提高干扰避免技术的能力,但在实践中,稳定的吞吐量区域比能力区域更具有相关性。在这项工作中,我们侧重于分布式发射机双面间歇干扰网络的稳定输送量区域,并提议在不同制度中以队列为基础的传输协议来处理队列间数据。在这方面,我们翻译物理级IM协议,以容纳随机抵达的信息。为了评估我们拟议的技术,我们将稳定的吞吐量区域与能力区域进行比较,并通过模拟显示稳定的吞吐量区域与能力区域相匹配,而能力区域与能力区域相对应。我们表明,为了实现最佳的稳定吞吐量区域,需要与以前的结果相比较新的要素。我们量化了拟议办法的编码/解码复杂性(按所需平方位操作的数量计算)与可实现的比率之间的权衡。我们研究了信息的寿命(即从到达到成功发送的时间)相对于通信总时间的长度,我们观察了通信的平均寿命,我们观察了整个通信期的平方平方平方平段。