A randomized algorithm for gossiping in radio networks

DOI10.1002/NET.10109MaRDI QIDQ4458725zbMATH OpenOpenAlexFDO

Authors Marek Chrobak, Leszek Gąsieniec, Wojciech Rytter

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

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)

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

Cites work

• scientific article; zbMATH DE number 1405786 (Why is no real title available?)
• Single round simulation on radio networks

Cited in

(11)

• Fast broadcasting and gossiping in radio networks
• Information gathering in ad-hoc radio networks
• Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults
• Information gathering in ad-hoc radio networks with tree topology
• On Efficient Gossiping in Radio Networks
• scientific article; zbMATH DE number 1796990 (Why is no real title available?)
• Asymptotically optimal gossiping in radio networks
• scientific article; zbMATH DE number 2089989 (Why is no real title available?)
• Sensor Network Gossiping or How to Break the Broadcast Lower Bound
• An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
• The cost of global broadcast in dynamic radio networks

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)