A randomized algorithm for gossiping in radio networks

DOI10.1002/NET.10109zbMATH Open1069.68654OpenAlexW2062404889MaRDI QIDQ4458725FDOQ4458725

Marek Chrobak, Wojciech Rytter, Leszek Gąsieniec

Publication date: 15 March 2004

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.543

Recommendations

• scientific article; zbMATH DE number 1796990
• scientific article; zbMATH DE number 2089989
• An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
• Broadcasting algorithms in radio networks with unknown topology
• Fast broadcasting and gossiping in radio networks

zbMATH Keywords

randomized algorithmsgossipingradio networks

Mathematics Subject Classification ID

Randomized algorithms (68W20) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Cites Work

• Single round simulation on radio networks
• Title not available (Why is that?)

Cited In (12)

• An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
• Title not available (Why is that?)
• Asymptotically optimal gossiping in radio networks
• Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults
• Sensor Network Gossiping or How to Break the Broadcast Lower Bound
• Fast broadcasting and gossiping in radio networks
• On Efficient Gossiping in Radio Networks
• The cost of global broadcast in dynamic radio networks
• Information gathering in ad-hoc radio networks with tree topology
• Faster information gathering in ad-hoc radio tree networks
• Information gathering in ad-hoc radio networks
• Title not available (Why is that?)

This page was built for publication: A randomized algorithm for gossiping in radio networks

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