Distributed approximation and tracking using selective gossip

D. Üstebay, R.M. Castro, M. Coates, M. Rabbat

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

Abstract

This chapter presents selective gossip which is an algorithm that applies the idea of iterative information exchange to vectors of data. Instead of communicating the entire vector and wasting network resources, our method adaptively focuses communication on the most significant entries of the vector. We prove that nodes running selective gossip asymptotically reach consensus on these significant entries, and they simultaneously reach an agreement on the indices of entries which are insignificant. The results demonstrate that selective gossip provides significant communication savings in terms of the number of scalars transmitted. In the second part of the chapter we propose a distributed particle filter employing selective gossip. We show that distributed particle filters employing selective gossip provide comparable results to the centralized bootstrap particle filter while decreasing the communication overhead compared to using randomized gossip to distribute the filter computations.
Original languageEnglish
Title of host publicationCompressed sensing & sparse filtering
EditorsL. Mihaylova, S.J. Godsill
Place of PublicationBerlin
PublisherSpringer
Pages325-355
ISBN (Print)978-3-642-38397-7
DOIs
Publication statusPublished - 2014

Publication series

NameSignals and Communication Technology
ISSN (Print)1860-4862

Fingerprint Dive into the research topics of 'Distributed approximation and tracking using selective gossip'. Together they form a unique fingerprint.

Cite this