Fast radio broadcasting with advice

DOI10.1016/J.TCS.2010.01.004MaRDI QIDQ962160zbMATH OpenOpenAlexFDO

Authors David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc

Publication date 6 April 2010

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2010.01.004

zbMATH Keywords

advicedistributed algorithmdeterministic broadcastingradio network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Fast Radio Broadcasting with Advice
• Trade-offs between the size of advice and broadcasting time in trees
• Communication algorithms with advice
• Faster Deterministic Broadcasting in Ad Hoc Radio Networks
• Faster broadcasting in unknown radio networks

Cites work

• scientific article; zbMATH DE number 1670865 (Why is no real title available?)
• scientific article; zbMATH DE number 5764877 (Why is no real title available?)
• A lower bound for radio broadcast
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
• Broadcasting algorithms in radio networks with unknown topology
• Broadcasting in UDG radio networks with unknown topology
• Broadcasting in geometric radio networks
• Broadcasting in undirected ad hoc radio networks
• Broadcasting on \([0,L]\)
• Centralized broadcast in multihop radio networks
• Deterministic broadcasting in ad hoc radio networks
• Distributed Computing with Advice: Information Sensitivity of Graph Coloring
• Faster communication in known topology radio networks
• Graph Searching with Advice
• Improved schedule for radio broadcast
• Local MST computation with short advice
• Lower bounds for the broadcast problem in mobile radio networks
• On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
• 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
• Oracle size, a new measure of difficulty for communication tasks
• STACS 2004
• Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
• The impact of information on broadcasting time in linear radio networks.
• The wakeup problem in synchronous broadcast systems
• Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
• Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
• Tree exploration with advice

Cited in

(13)

• Topology recognition with advice
• Edge exploration of anonymous graph by mobile agent with external help
• Fast rendezvous with advice
• Drawing maps with advice
• Trade-offs between the size of advice and broadcasting time in trees
• Impact of knowledge on election time in anonymous networks
• Communication algorithms with advice
• Deterministic size discovery and topology recognition in radio networks with short labels
• Four shades of deterministic leader election in anonymous networks
• Finding the size and the diameter of a radio network using short labels
• Labeling schemes for deterministic radio multi-broadcast
• Fast Radio Broadcasting with Advice
• Advice complexity of maximum independent set in sparse and bipartite graphs

This page was built for publication: Fast radio broadcasting with advice

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