Sensor Network Gossiping or How to Break the Broadcast Lower Bound

DOI10.1007/978-3-540-77120-3_22zbMath1193.68028OpenAlexW1541480637MaRDI QIDQ5387760

Martín Farach-Colton, Miguel A. Mosteiro

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_22

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items (5)

Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony ⋮ Empirical Distribution of Equilibrium Play and Its Testing Application ⋮ Unbounded Contention Resolution in Multiple-Access Channels ⋮ Deterministic recurrent communication in restricted sensor networks ⋮ On Efficient Gossiping in Radio Networks

Cites Work

• Unnamed Item
• Unnamed Item
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Multiple Communication in Multihop Radio Networks
• Fast broadcasting and gossiping in radio networks
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
• A randomized algorithm for gossiping in radio networks
• Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
• Lower bounds for the broadcast problem in mobile radio networks
• Maximal independent sets in radio networks
• On selection problem in radio networks
• Probability and Computing
• Algorithms – ESA 2005
• Broadcasting algorithms in radio networks with unknown topology

This page was built for publication: Sensor Network Gossiping or How to Break the Broadcast Lower Bound