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

部分消息传递干扰信道的分布式通用最优策略

Distributed Universally Optimal Strategies for Interference Channels with Partial Message Passing

Vaneet Aggarwal, Salman Avestimehr, Ashutosh Sabharwal

摘要:

在分布式无线网络中,节点通常不知道网络的拓扑结构(网络大小、连通性和信道增益)。因此,它们必须以分布式方式计算它们的发送和接收参数。本文考虑在确定性干扰信道中,每个发射机知道距离它至多两跳的所有链路的信道增益,而接收机知道距离它至多三跳的所有链路的信道增益。有了这个有限的信息,我们找到一个条件的网络连接,存在一个分布式的策略,可以选择由用户与部分信息的网络状态,它实现了相同的总和容量,可实现的集中式服务器,知道所有的信道增益。具体地说,分布式决策只有在每个连接组件处于一对多配置或全连接配置时才是速率和最优的。在所有其他网络连接情况下,损失可以任意大。

英文摘要:

In distributed wireless networks, nodes often do not know the topology (network size, connectivity and the channel gains) of the network. Thus, they have to compute their transmission and reception parameters in a distributed fashion. In this paper, we consider that each of the transmitter know the channel gains of all the links that are at-most two-hop distant from it and the receiver knows the channel gains of all the links that are three-hop distant from it in a deterministic interference channel. With this limited information, we find a condition on the network connectivity for which there exist a distributed strategy that can be chosen by the users with partial information about the network state, which achieves the same sum capacity as that achievable by the centralized server that knows all the channel gains. Specifically, distributed decisions are sum-rate optimal only if each connected component is in a one-to-many configuration or a fully-connected configuration. In all other cases of network connectivity, the loss can be arbitrarily large.

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

↑