Faster Deterministic Broadcasting in Ad Hoc Radio Networks

DOI10.1137/S089548010342464XzbMath1077.68518OpenAlexW2083877936MaRDI QIDQ4652640

Andrzej Pelc, Dariusz R. Kowalski

Publication date: 28 February 2005

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

distributed algorithmsbroadcastingradio networks

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (16)

Time efficient centralized gossiping in radio networks ⋮ Information gathering in ad-hoc radio networks with tree topology ⋮ Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization ⋮ Deterministic Communication in Radio Networks ⋮ Deterministic protocols in the SINR model without knowledge of coordinates ⋮ Optimal deterministic broadcasting in known topology radio networks ⋮ Broadcasting in geometric radio networks ⋮ Coordination Problems in Ad Hoc Radio Networks ⋮ On the communication complexity of Bar-Yehuda, Goldreich and Itai's randomized broadcasting algorithm ⋮ Faster information gathering in ad-hoc radio tree networks ⋮ Unnamed Item ⋮ Deterministic M2M multicast in radio networks ⋮ Token traversal in ad hoc wireless networks via implicit carrier sensing ⋮ Broadcasting in undirected ad hoc radio networks ⋮ Information gathering in ad-hoc radio networks ⋮ Time-Efficient Broadcast in Radio Networks

This page was built for publication: Faster Deterministic Broadcasting in Ad Hoc Radio Networks