Accelerating Approximate Consensus with Self-Organizing Overlays

@inproceedings{Beal2013AcceleratingAC,
  title={Accelerating Approximate Consensus with Self-Organizing Overlays},
  author={Jacob Beal},
  year={2013}
}
Laplacian-based approximate consensus algorithms are an important and frequently used building block in many distributed applications, including formation control, sensor fusion, and synchronization. These algorithms, however, converge extremely slowly on networks that are more than a few hops in diameter and where values are spatially correlated. This paper presents a new algorithm, Power Law Driven Consensus, which uses a self-organizing virtual overlay network to accelerate convergence, at a… CONTINUE READING