On adaptive deterministic gossiping in ad hoc radio networks.

DOI10.1016/S0020-0190(01)00312-XzbMath1051.68077OpenAlexW3138648409MaRDI QIDQ1853048

Andrzej Lingas, Leszek Gąsieniec

Publication date: 21 January 2003

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00312-x

zbMATH Keywords

Distributed computingGossipingDesign of algorithmsRadio network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (8)

Optimal gossiping in geometric radio networks in the presence of dynamical faults ⋮ Time efficient centralized gossiping in radio networks ⋮ Information dissemination in unknown radio networks with large labels ⋮ Labeling schemes for deterministic radio multi-broadcast ⋮ Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks ⋮ Round complexity of leader election and gossiping in bidirectional radio networks ⋮ Deterministic M2M multicast in radio networks ⋮ On Efficient Gossiping in Radio Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Faster broadcasting in unknown radio networks
• Distributed multi-broadcast in unknown radio networks
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks

This page was built for publication: On adaptive deterministic gossiping in ad hoc radio networks.