Geographic Gossip: Efficient Averaging for Sensor Networks

DOI10.1109/TSP.2007.908946MaRDI QIDQ4567739zbMATH OpenOpenAlexWikidataFDO

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

Publication date 27 June 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2007.908946

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(7)

• Consensus-based modeling using distributed feature construction with ILP
• Distributed gradient descent localization in wireless sensor networks
• Lower bounds for in-network computation of arbitrary functions
• Fault-tolerant aggregation: flow-updating meets mass-distribution
• Quantized consensus of multi-agent systems via broadcast gossip algorithms
• Accelerated gossip in networks of given dimension using Jacobi polynomial iterations
• Identifying frequent items in a network using gossip

This page was built for publication: Geographic Gossip: Efficient Averaging for Sensor Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4567739)