Round robin is optimal for fault-tolerant broadcasting on wireless networks
type: Item
instance of: scholarly article
title: Round robin is optimal for fault-tolerant broadcasting on wireless networks
zbMATH Open document ID: 1099.68504
author: Andrea Clementi
author: Angelo Monti
author: Riccardo Silvestri
published in: Journal of Parallel and Distributed Computing
publication date: 2004-09-08T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68M12
zbMATH DE Number: 2099277
MaRDI profile type: Publication
full work available at URL: j.jpdc.2003.06.004
OpenAlex ID: W1966511606
DOI: 10.1016/J.JPDC.2003.06.004
Recommended article: Q4796195
Recommended article: Optimal adaptive broadcasting with a bounded fraction of faulty nodes
Recommended article: Optimal deterministic broadcasting in known topology radio networks
Recommended article: Optimal adaptive broadcasting with a bounded fraction of faulty nodes (extended abstract)
Recommended article: On the Runtime and Robustness of Randomized Broadcasting
Recommended article: On the runtime and robustness of randomized broadcasting
Recommended article: On optimal broadcasting in faulty hypercubes
Recommended article: Approximating All-to-All Broadcast in Wireless Networks
Recommended article: Distributed Deterministic Broadcasting in Wireless Networks of Weak Devices
description: scientific article; zbMATH DE number 2099277