arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1807.06004cs.ITmath.IT
收藏

使用灵活消息队列的动态干扰管理的基本限制

Fundamental Limits of Dynamic Interference Management with Flexible Message Assignments

Tolunay Seyfi, Yasemin Karacora, Aly El Gamal

摘要:

干扰管理的问题被认为是在一个线性干扰网络的情况下,是长期的信道波动,由于阴影衰落。所使用的衰落模型是一个在网络中的每个链路是独立的概率为p的擦除。它是假设,在网络中的每个接收器是在一个唯一的消息,这是在M个发射机可用感兴趣。从自由度(DoF)的角度分析了无擦除设置的最优方案,并提出了在更高的擦除概率下具有更好的平均DoF性能的新方案。另外,对于M=1,针对每个p值表征每用户DoF的平均值,并且识别最优消息分配。对于M>1,它首先建立,有没有战略分配的消息,在网络中的发射机是最佳的所有值的p.最佳的合作迫零方案,然后确定为M=2,并示出信息理论上最优时,最大的子网,不包含删除的链接的大小是最多5。

英文摘要:

The problem of interference management is considered in the context of a linear interference network that is subject to long term channel fluctuations due to shadow fading. The fading model used is one where each link in the network is subject independently to erasure with probability p. It is assumed that each receiver in the network is interested in one unique message, which is made available at M transmitters. Optimal schemes from a Degrees of Freedom (DoF) viewpoint are analyzed for the setting of no erasures, and new schemes are proposed with better average DoF performance at higher probabilities of erasure. Additionally, for M=1, the average per user DoF is characterized for every value of p, and optimal message assignments are identified. For M>1, it is first established that there is no strategy for assigning messages to transmitters in networks that is optimal for all values of p. The optimal cooperative zero-forcing scheme for M=2 is then identified, and shown to be information-theoretically optimal when the size of the largest subnetwork that contains no erased links is at most five.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑