arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1312.0040cs.ITmath.IT
收藏

动态干扰管理

Dynamic Interference Management

Aly El Gamal, Venugopal V. Veeravalli

摘要:

考虑线性干扰网络。无线信道中的长期波动(阴影衰落)可能导致任何链路以概率p被擦除。每个接收器对M个发射器处可用的一个唯一消息感兴趣。在蜂窝下行链路场景中,M=1的情况反映了小区关联问题,而M>1的情况反映了建立用于协作多点(CoMP)传输的回程链路的问题。在这两种情况下,我们分析了自由度(DoF)的最佳方案的情况下,没有擦除,并提出了新的计划具有更好的平均DoF性能在高概率的擦除。对于M=1,我们的特点是每个用户的平均自由度,并确定在每个值的p的消息发送器的最佳分配。对于一般值的M,我们表明,没有策略分配消息发送器在大型网络中,是最佳的所有值的p。

英文摘要:

A linear interference network is considered. Long-term fluctuations (shadow fading) in the wireless channel can lead to any link being erased with probability p. Each receiver is interested in one unique message that can be available at M transmitters. In a cellular downlink scenario, the case where M=1 reflects the cell association problem, and the case where M>1 reflects the problem of setting up the backhaul links for Coordinated Multi-Point (CoMP) transmission. In both cases, we analyze Degrees of Freedom (DoF) optimal schemes for the case of no erasures, and propose new schemes with better average DoF performance at high probabilities of erasure. For M=1, we characterize the average per user DoF, and identify the optimal assignment of messages to transmitters at each value of p. For general values of M, we show that there is no strategy for assigning messages to transmitters in large networks that is optimal for all values of p.

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

↑