Directed gossiping for distributed data aggregation

Mehmet E. Yildiz, Anna Scaglione

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

In this paper, we are studying a class of distributed data aggregation problems where a set of nodes in a network is interested in a function of data that is stored in another set of nodes. Assuming the function of interest is separable, we propose an algorithm based on gossiping schemes. Gossiping protocols are iterative methods based on near neighbor communications, and they are known to be efficient and robust to link/node failures. In this work, after formulating the problem mathematically, and introducing previously proposed necessary and sufficient conditions on the gossiping updates, we introduce several necessary conditions on the feasible codes which will provide significant intuition in determining the (in)feasibility of a given problem. By focusing on stochastic codes, we provide a necessary condition based on topology and discuss scenarios where the codes we seek cannot be found.

Original languageEnglish (US)
Title of host publicationCAMSAP 2009 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing
Pages53-56
Number of pages4
DOIs
StatePublished - Dec 1 2009
Externally publishedYes
Event2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2009 - Aruba, Netherlands
Duration: Dec 13 2009Dec 16 2009

Publication series

NameCAMSAP 2009 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing

Other

Other2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2009
CountryNetherlands
CityAruba
Period12/13/0912/16/09

Keywords

  • Data aggregation
  • Distributed algorithms
  • Gossiping algorithms

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Software

Fingerprint Dive into the research topics of 'Directed gossiping for distributed data aggregation'. Together they form a unique fingerprint.

  • Cite this

    Yildiz, M. E., & Scaglione, A. (2009). Directed gossiping for distributed data aggregation. In CAMSAP 2009 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (pp. 53-56). [5413241] (CAMSAP 2009 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing). https://doi.org/10.1109/CAMSAP.2009.5413241