Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound)

DOI10.1016/j.tcs.2012.11.030zbMath1259.68016OpenAlexW2137922115MaRDI QIDQ1939254

Antonio Fernández Anta, Martín Farach-Colton, Miguel A. Mosteiro

Publication date: 4 March 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.11.030

zbMATH Keywords

gossipingdistributed algorithmsbroadcastconvergecastsensor networksradio networks

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (1)

Unbounded contention resolution in multiple-access channels

This page was built for publication: Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound)