Time-efficient randomized multiple-message broadcast in radio networks

DOI10.1145/1993806.1993884zbMath1321.68315OpenAlexW2072976381MaRDI QIDQ2943411

Majid Khabbazian, Dariusz R. Kowalski

Publication date: 11 September 2015

Published in: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

randomized algorithmradio networksmultiple-message broadcast

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Network protocols (68M12) Distributed algorithms (68W15)

Related Items

Information gathering in ad-hoc radio networks with tree topology, Distributed multiple-message broadcast in wireless ad hoc networks under the SINR model, Randomized broadcast in radio networks with collision detection, Dynamic multiple-message broadcast: bounding throughput in the affectance model, The cost of global broadcast in dynamic radio networks, Bounded-contention coding for the additive network model, Information dissemination in wireless ad-hoc networks under the weighted-TIM framework

Cites Work

• Unnamed Item
• Gradient clock synchronization in dynamic networks
• Consensus algorithms with one-bit messages
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Broadcasting in dynamic radio networks
• Programming simultaneous actions using common knowledge
• Continuous consensus via common knowledge
• Distributed computation in dynamic networks
• Flooding time in edge-Markovian dynamic graphs
• Knowledge and common knowledge in a distributed environment
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony
• Fault Tolerance in Networks of Bounded Degree
• Reaching Agreement in the Presence of Faults
• Perfectly secure message transmission
• Parsimonious flooding in dynamic graphs
• Optimal gradient clock synchronization in dynamic networks
• Almost-Everywhere Secure Computation