Randomized broadcast in radio networks with collision detection

DOI10.1145/2484239.2484248zbMath1323.68556OpenAlexW2048113794MaRDI QIDQ5176111

Bernhard Haeupler, Mohsen Ghaffari, Majid Khabbazian

Publication date: 2 March 2015

Published in: Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2484239.2484248

zbMATH Keywords

collision detectionwireless networksbroadcastradio networksrandom linear network coding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (6)

Design patterns in beeping algorithms: examples, emulation, and analysis ⋮ Finding the size and the diameter of a radio network using short labels ⋮ Deterministic size discovery and topology recognition in radio networks with short labels ⋮ Dynamic multiple-message broadcast: bounding throughput in the affectance model ⋮ Deterministic Communication in Radio Networks ⋮ Unnamed Item

This page was built for publication: Randomized broadcast in radio networks with collision detection