Exactly optimal deterministic radio broadcasting with collision detection

DOI10.1007/978-3-031-09993-9_13MaRDI QIDQ2097351zbMATH OpenOpenAlexFDO

Authors Koko Nanahji

Publication date 11 November 2022

Full work available at URL https://arxiv.org/abs/2202.06375

zbMATH Keywords

beep modelbroadcastcollision detectiondistributedencodingradio network

Mathematics Subject Classification ID

Computer system organization (68Mxx) Communication complexity, information complexity (68Q11) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A lower bound for radio broadcast
• An \Omega(D\log (N/D)) Lower Bound for Broadcast in Radio Networks
• Asynchronous broadcasting with bivalent beeps
• Broadcasting algorithms in radio networks with unknown topology
• Broadcasting in undirected ad hoc radio networks
• Deterministic broadcasting in ad hoc radio networks
• Deterministic communication in radio networks
• Distributed broadcast in radio networks of unknown topology.
• Fast broadcasting and gossiping in radio networks
• Near optimal leader election in multi-hop radio networks
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Optimal deterministic broadcasting in known topology radio networks
• Randomized broadcast in radio networks with collision detection
• The energy complexity of broadcast

Cited in

(3)

• scientific article; zbMATH DE number 1670865 (Why is no real title available?)
• Reliable broadcast in radio networks
• SOFSEM 2006: Theory and Practice of Computer Science

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Exactly optimal deterministic radio broadcasting with collision detection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097351)