Distributed Broadcast in Unknown Radio Networks

DOI10.1137/080733826zbMath1206.68142OpenAlexW1983915440MaRDI QIDQ3068628

Gianluca De Marco

Publication date: 17 January 2011

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/080733826

zbMATH Keywords

communication networksdistributed algorithmsprobabilistic methodsradio networktime complexity of deterministic broadcasting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (17)

Contention resolution in a non-synchronized multiple access channel ⋮ Information dissemination in unknown radio networks with large labels ⋮ Information gathering in ad-hoc radio networks with tree topology ⋮ Deterministic non-adaptive contention resolution on a shared channel ⋮ Unnamed Item ⋮ Scalable wake-up of multi-channel single-hop radio networks ⋮ Deterministic Communication in Radio Networks ⋮ Round complexity of leader election and gossiping in bidirectional radio networks ⋮ Energy-efficient broadcasting in ad hoc wireless networks ⋮ Improved lower bound for deterministic broadcasting in radio networks ⋮ Unnamed Item ⋮ Subquadratic non-adaptive threshold group testing ⋮ Message and time efficient multi-broadcast schemes ⋮ Information gathering in ad-hoc radio networks ⋮ Bounded-contention coding for the additive network model ⋮ Optimal channel utilization with limited feedback ⋮ Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel

This page was built for publication: Distributed Broadcast in Unknown Radio Networks