On adaptive deterministic gossiping in ad hoc radio networks.
type: Item
instance of: scholarly article
title: On adaptive deterministic gossiping in ad hoc radio networks.
zbMATH Open document ID: 1051.68077
DOI: 10.1016/S0020-0190(01)00312-X
author: Leszek Gąsieniec
author: Andrzej Lingas
published in: Information Processing Letters
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1856394
zbMATH Keywords: Design of algorithms
zbMATH Keywords: Distributed computing
zbMATH Keywords: Radio network
zbMATH Keywords: Gossiping
MaRDI profile type: Publication
cites work: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
cites work: Q4788606
cites work: Q4952711
cites work: Q4551385
cites work: Distributed multi-broadcast in unknown radio networks
cites work: Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
cites work: Q4796195
cites work: Q4829004
cites work: An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
cites work: Faster broadcasting in unknown radio networks
full work available at URL: s0020-0190(01)00312-x
OpenAlex ID: W3138648409
description: scientific article; zbMATH DE number 1856394