Geographic Gossip: Efficient Averaging for Sensor Networks

DOI10.1109/TSP.2007.908946zbMath1390.94150OpenAlexW2168630576WikidataQ60021636 ScholiaQ60021636MaRDI QIDQ4567739

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

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

Related Items (7)

Consensus-based modeling using distributed feature construction with ILP ⋮ Fault-tolerant aggregation: flow-updating meets mass-distribution ⋮ Quantized Consensus of Multi-Agent Systems Via Broadcast Gossip Algorithms ⋮ Distributed gradient descent localization in wireless sensor networks ⋮ Identifying frequent items in a network using gossip ⋮ Lower bounds for in-network computation of arbitrary functions ⋮ Accelerated Gossip in Networks of Given Dimension Using Jacobi Polynomial Iterations

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