On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
type: Item
instance of: scholarly article
title: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
zbMATH Open document ID: 0752.68009
DOI: 10.1016/0022-0000(92)90042-H
author: Oded Goldreich
author: Alon Itai
author: Reuven Bar-Yehuda
published in: Journal of Computer and System Sciences
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 90314
zbMATH Keywords: randomized protocol
zbMATH Keywords: deterministic broadcast protocol
MaRDI profile type: Publication
cites work: Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
cites work: On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
cites work: Q4065548
cites work: A perspective on multiaccess channels
cites work: A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
cites work: Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
cites work: Born again group testing: Multiaccess communications
description: scientific article; zbMATH DE number 90314