Distributed broadcast in unknown radio networks

<a class="pub-badge pub-badge--doi" href="https://doi.org/10.1137/080733826" rel="nofollow">DOI 10.1137/080733826</a><a class="pub-badge pub-badge--grey" href="https://zbmath.org/1206.68142" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--grey" href="https://openalex.org/works/W1983915440" rel="nofollow">OpenAlex</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q3068628" rel="nofollow">MaRDI QID Q3068628</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q3068628" rel="nofollow">FDO</a>

Authors 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

distributed algorithmscommunication networksprobabilistic methodsradio networktime complexity of deterministic broadcasting

Mathematics Subject Classification ID

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

Recommendations

• Faster broadcasting in unknown radio networks
• Broadcasting algorithms in radio networks with unknown topology
• Publication:4952711
• Faster Deterministic Broadcasting in Ad Hoc Radio Networks
• scientific article; zbMATH DE number 1670865

Cited in

(25)

• Distributed bare-bones communication in wireless networks
• Distributed multi-broadcast in unknown radio networks
• Information gathering in ad-hoc radio networks
• Optimal channel utilization with limited feedback
• Information dissemination in unknown radio networks with large labels
• Message and time efficient multi-broadcast schemes
• Deterministic communication in radio networks
• Structural Information and Communication Complexity
• Improved lower bound for deterministic broadcasting in radio networks
• Information gathering in ad-hoc radio networks with tree topology
• Fast nonadaptive deterministic algorithm for conflict resolution in a dynamic multiple-access channel
• Scalable wake-up of multi-channel single-hop radio networks
• scientific article; zbMATH DE number 7378397 (Why is no real title available?)
• Deterministic blind radio networks
• Bounded-contention coding for the additive network model
• Subquadratic non-adaptive threshold group testing
• A Faster Distributed Radio Broadcast Primitive
• Distributed broadcasting and mapping protocols in directed anonymous networks
• A (truly) local broadcast layer for unreliable radio networks
• Deterministic non-adaptive contention resolution on a shared channel
• Round complexity of leader election and gossiping in bidirectional radio networks
• Contention resolution in a non-synchronized multiple access channel
• Energy-efficient broadcasting in ad hoc wireless networks
• Faster broadcasting in unknown radio networks
• Distributed broadcast in radio networks of unknown topology.

This page was built for publication: Distributed broadcast in unknown radio networks

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