分布式共识无线传感器网络广播Gossip算法研究

项目名称： 分布式共识无线传感器网络广播Gossip算法研究

项目编号： No.61201147

项目类型： 青年科学基金项目

立项/批准年度： 2013

项目学科： 电子学与信息系统

项目作者： 吴少川

作者单位： 哈尔滨工业大学

项目金额： 25万元

中文摘要： Gossip算法由于采用了随机行走模式来传递数据，和端到端基于路由的通信方式相比，有效地避免了拥塞和路径失效问题，因而更适合于分布式的无线传感器网络。作为一个重要的应用，基于Gossip算法的分布式共识得到了国际上的广泛研究。但是，这一领域现有的研究成果普遍集中于成对Gossip算法，收敛速度慢并只能用于对称链路的网络。而近几年出现的广播Gossip算法，不但可以有效利用无线信道的单向广播特性，还可以在一次迭代过程中使多个节点完成数据平均，因此具有更优越的性能。但是目前国际上的广播Gossip算法，或者无法收敛于初始状态的均值，或者无法证明其收敛性。针对这些问题，本项目将在国际上首次提出在数学上可证明共识收敛于均值的广播Gossip算法；并首次在广播Gossip算法中提出加扰参数的上确界和最优化；首次分析广Gossip聊算法在信道干扰条件下的收敛性能以及在量化误差环境下的收敛精度性能。

中文关键词： Gossip算法；分布式信号处理；无线传感器网络；分布式共识；

英文摘要： By launching messages on random walk instead of end-to-end routing, gossip algorithms are more suitable for distributed wireless sensor networks because congestion and link failure can be efficiently resisted. Great effort has been directed to the study of gossip algorithms for distributed consensus. Although there are many exciting research results of pairwise gossip algorithms, some natural defects, including slow rate of convergence and only availability in undirected graphs, influence their practical applications. To solve these problems, broadcast gossip algorithms were proposed in recent years.They can efficiently cope with directed links and utilize the broadcasting property of wireless media. In addition, broadcast gossip algorithms allow more than two nodes to accomplish updates at each iteration so the rate of convergence is faster than pairwise gossip algorithms. Unfortunately, all proposed broadcast gossip algorithms can be sort into two classes: one doesn't preserve average and another cannot be proven convergence by mathematics. Therefore, it's the first time that broadcast gossip algorithms proposed in this project can preserve average, meanwhile, the convergence can be proven by mathematics. After that, the tight upper bound and optimization of perturbation parameter will be analyzed, which will

英文关键词： Gossip Algorithm；Distributed Signal Processing；Wireless Sensor Networks；Distributed Consensus；