Fast broadcasting and gossiping in radio networks

DOI10.1016/S0196-6774(02)00004-4zbMath1005.68009MaRDI QIDQ3150281

Marek Chrobak, Wojciech Rytter, Leszek Gąsieniec

Publication date: 30 September 2002

Published in: Journal of Algorithms (Search for Journal in Brave)

zbMATH Keywords

deterministic distributed broadcasting

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

Related Items

Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks, Sensor Network Gossiping or How to Break the Broadcast Lower Bound, Coordination Problems in Ad Hoc Radio Networks, Information Spreading in Dynamic Networks: An Analytical Approach, Almost optimal distributed M2M multicasting in wireless mesh networks, Improved lower bound for deterministic broadcasting in radio networks, Modeling radio networks, Acknowledged broadcasting and gossiping in ad hoc radio networks, Broadcasting in geometric radio networks, Broadcasting in dynamic radio networks, Energy efficient randomised communication in unknown AdHoc networks, Optimal gathering protocols on paths under interference constraints, Faster broadcasting in unknown radio networks, Time efficient centralized gossiping in radio networks, On the communication complexity of Bar-Yehuda, Goldreich and Itai's randomized broadcasting algorithm, Radio communication in random graphs, Deterministic M2M multicast in radio networks, Optimal gossiping in geometric radio networks in the presence of dynamical faults, Efficient Distributed Communication in Ad-Hoc Radio Networks, Time-Efficient Broadcast in Radio Networks, On Efficient Gossiping in Radio Networks, Centralized Communication in Radio Networks with Strong Interference, On Radio Broadcasting in Random Geometric Graphs, Broadcasting in UDG Radio Networks with Missing and Inaccurate Information