The impact of information on broadcasting time in linear radio networks.

DOI10.1016/S0304-3975(01)00256-0zbMath1061.68008OpenAlexW2047677968MaRDI QIDQ1853489

Krzysztof Diks, Evangelos Kranakis, Andrzej Pelc, Danny Krizanc

Publication date: 21 January 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00256-0

zbMATH Keywords

BroadcastingRadio networkDistributed deterministic algorithm

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (11)

Broadcasting in UDG radio networks with missing and inaccurate information ⋮ Broadcasting in UDG radio networks with unknown topology ⋮ Time efficient centralized gossiping in radio networks ⋮ Fast Radio Broadcasting with Advice ⋮ Almost optimal distributed M2M multicasting in wireless mesh networks ⋮ Broadcasting in geometric radio networks ⋮ Broadcasting in UDG Radio Networks with Missing and Inaccurate Information ⋮ Fast radio broadcasting with advice ⋮ Trade-offs between the size of advice and broadcasting time in trees ⋮ Faster deterministic communication in radio networks ⋮ Time-Efficient Broadcast in Radio Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A lower bound for radio broadcast
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Broadcasting on \([0,L\)]
• Fault-Tolerant Broadcasting in Radio Networks
• Multiple Communication in Multihop Radio Networks
• On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks

This page was built for publication: The impact of information on broadcasting time in linear radio networks.