A randomized algorithm for gossiping in radio networks
From MaRDI portal
Publication:4458725
DOI10.1002/net.10109zbMath1069.68654MaRDI QIDQ4458725
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
90B18: Communication networks in operations research
68M10: Network design and communication in computer systems
68W20: Randomized algorithms
Related Items
Sensor Network Gossiping or How to Break the Broadcast Lower Bound, 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, The cost of global broadcast in dynamic radio networks, On Efficient Gossiping in Radio Networks
Cites Work