Faster broadcasting in unknown radio networks

DOI10.1016/S0020-0190(00)00178-2zbMath0998.68222OpenAlexW2021893324MaRDI QIDQ1603436

Gianluca De Marco, Andrzej Pelc

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00178-2

zbMATH Keywords

algorithmsbroadcastingradio networkselective family

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Related Items (21)

Fast message dissemination in random geometric networks ⋮ Information dissemination in unknown radio networks with large labels ⋮ Deterministic broadcasting time with partial knowledge of the network. ⋮ Unnamed Item ⋮ Deterministic Communication in Radio Networks ⋮ Optimal deterministic broadcasting in known topology radio networks ⋮ Broadcasting in geometric radio networks ⋮ On Radio Broadcasting in Random Geometric Graphs ⋮ Round complexity of leader election and gossiping in bidirectional radio networks ⋮ Deterministic broadcasting in ad hoc radio networks ⋮ Energy-efficient broadcasting in ad hoc wireless networks ⋮ Improved lower bound for deterministic broadcasting in radio networks ⋮ Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism ⋮ Radio communication in random graphs ⋮ Unnamed Item ⋮ Deterministic M2M multicast in radio networks ⋮ On the effect of the deployment setting on broadcasting in Euclidean radio networks ⋮ Collision-free path coloring with application to minimum-delay gathering in sensor networks ⋮ Time-Efficient Broadcast in Radio Networks ⋮ On Efficient Gossiping in Radio Networks ⋮ On adaptive deterministic gossiping in ad hoc radio networks.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Families of finite sets in which no set is covered by the union of \(r\) others
• A lower bound for radio broadcast
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Multiple Communication in Multihop Radio Networks
• Fast broadcasting and gossiping in radio networks
• Deterministic Sampling–A New Technique for Fast Pattern Matching
• On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
• A perspective on multiaccess channels
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
• Lower bounds for the broadcast problem in mobile radio networks

This page was built for publication: Faster broadcasting in unknown radio networks