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

地理流言:传感器网络的有效聚合

Geographic Gossip: Efficient Aggregation for Sensor Networks

Alexandros G. Dimakis, Anand D. Sarwate, Martin J. Wainwright

摘要:

Gossip聚合算法由于其简单性和在噪声和不确定环境中的鲁棒性,最近受到了传感器网络应用的极大关注。然而,流言算法会通过多次传递冗余信息来浪费大量的能量。对于实际的传感器网络模型拓扑结构,如网格和随机几何图,流言计划的效率低下是由于这些图上的随机游动混合时间慢。我们提出并分析了另一种八卦计划,利用地理信息。通过利用一个简单的reservation方法,我们可以证明以前提出的八卦协议的实质性收益。特别是,对于随机几何图形,我们的算法计算真正的平均精度$1/n^a$使用$O(n^{1.5}\sqrt{\log n})$无线电传输,这减少了能量消耗的$\sqrt{\frac{n}{\log n}}$因素超过标准的八卦算法。

英文摘要:

Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain environments. However, gossip algorithms can waste significant energy by essentially passing around redundant information multiple times. For realistic sensor network model topologies like grids and random geometric graphs, the inefficiency of gossip schemes is caused by slow mixing times of random walks on those graphs. We propose and analyze an alternative gossiping scheme that exploits geographic information. By utilizing a simple resampling method, we can demonstrate substantial gains over previously proposed gossip protocols. In particular, for random geometric graphs, our algorithm computes the true average to accuracy $1/n^a$ using $O(n^{1.5}\sqrt{\log n})$ radio transmissions, which reduces the energy consumption by a $\sqrt{\frac{n}{\log n}}$ factor over standard gossip algorithms.

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

↑