arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1011.2235cs.DC
收藏

无线分组网络中用于有效分散平均的多尺度流言

Multiscale Gossip for Efficient Decentralized Averaging in Wireless Packet Networks

Konstantinos I. Tsianos, Michael G. Rabbat

摘要:

本文描述和分析了一种用于解决无线传感器网络中分布式平均一致性问题的分层流言算法。网络被递归地划分为子网络。最初,最小规模的节点进行闲聊以计算局部平均值。然后,使用地理路由来实现没有直接连接的节点之间的流言,这些局部平均值逐渐融合到层次结构中,直到计算出全局平均值。我们表明,所提出的分层计划与$k$层次结构的水平是有竞争力的国家的最先进的随机八卦算法,在消息的复杂性,实现$ε$ -准确性后,$O\big(n \log \log n \log \frac{kn}ε \big)$消息的概率很高。我们分析的关键是网络递归划分的方式。我们发现,最佳的缩放定律时,规模$j$子网络包含$O(n^{(2/3)^j})$节点,然后在任何个人规模的消息复杂度是$O(n \log \frac{kn}ε)$,和总数量的层次结构中的规模增长缓慢,作为$Θ(\log \log n)$。分层结构的另一个重要结果是,消息交换的最长距离是$O(n^{1/3})$跳(在最高尺度下),而大多数消息(在较低尺度下)传播的距离较短。在使用链路级重传的网络中,这通过减少消息重传来减少拥塞和资源使用。仿真结果表明,该方案是更有效的消息比现有的国家的最先进的随机八卦算法的基础上平均沿路径。

英文摘要:

This paper describes and analyzes a hierarchical gossip algorithm for solving the distributed average consensus problem in wireless sensor networks. The network is recursively partitioned into subnetworks. Initially, nodes at the finest scale gossip to compute local averages. Then, using geographic routing to enable gossip between nodes that are not directly connected, these local averages are progressively fused up the hierarchy until the global average is computed. We show that the proposed hierarchical scheme with $k$ levels of hierarchy is competitive with state-of-the-art randomized gossip algorithms, in terms of message complexity, achieving $ε$-accuracy with high probability after $O\big(n \log \log n \log \frac{kn}ε \big)$ messages. Key to our analysis is the way in which the network is recursively partitioned. We find that the optimal scaling law is achieved when subnetworks at scale $j$ contain $O(n^{(2/3)^j})$ nodes; then the message complexity at any individual scale is $O(n \log \frac{kn}ε)$, and the total number of scales in the hierarchy grows slowly, as $Θ(\log \log n)$. Another important consequence of hierarchical construction is that the longest distance over which messages are exchanged is $O(n^{1/3})$ hops (at the highest scale), and most messages (at lower scales) travel shorter distances. In networks that use link-level acknowledgements, this results in less congestion and resource usage by reducing message retransmissions. Simulations illustrate that the proposed scheme is more message-efficient than existing state-of-the-art randomized gossip algorithms based on averaging along paths.

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

↑