arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1312.5202eess.SYcs.SY
收藏

在干扰下的共识

Consensus in the presence of interference

Tufts University(塔夫茨大学)

Usman A. Khan, Shuchin Aeron

AI总结:

本文研究了在存在网络干扰的情况下任意向量的分布式平均共识策略。通过将干扰转化为代数结构,修改标准协议以在干扰子空间的互补子空间中达到平均值。利用信息对齐技术,使传输对齐于干扰的零空间,从而实现共识。

摘要:

本文研究了在存在网络干扰的情况下任意向量的分布式平均共识策略。我们假设任何链路上的通信都会受到其他代理根据自身共识协议进行通信引起的加性干扰的影响。此外,没有任何代理知道有多少或哪些代理在干扰其通信。显然,标准共识协议在这种情况下不再适用。在本文中,我们对干扰施加代数结构,并展示标准协议可以被修改,使得平均值可以在与所有通信链路的最大干扰子空间维度互补的子空间中达到。为了得出结果,我们使用信息对齐技术,将预期传输对齐到每个链路上的干扰的零空间。我们证明这种对齐确实是可逆的,即可以恢复预期传输,从而后续执行共识协议。即使干扰子空间集合张成整个向量空间,局部协议的存在也有些令人惊讶。

英文摘要:

This paper studies distributed strategies for average-consensus of arbitrary vectors in the presence of network interference. We assume that the underlying communication on any \emph{link} suffers from \emph{additive interference} caused due to the communication by other agents following their own consensus protocol. Additionally, no agent knows how many or which agents are interfering with its communication. Clearly, the standard consensus protocol does not remain applicable in such scenarios. In this paper, we cast an algebraic structure over the interference and show that the standard protocol can be modified such that the average is reachable in a subspace whose dimension is complimentary to the maximal dimension of the interference subspaces (over all of the communication links). To develop the results, we use \emph{information alignment} to align the intended transmission (over each link) to the null-space of the interference (on that link). We show that this alignment is indeed invertible, i.e. the intended transmission can be recovered over which, subsequently, consensus protocol is implemented. That \emph{local} protocols exist even when the collection of the interference subspaces span the entire vector space is somewhat surprising.

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

↑