Optimal gossiping in geometric radio networks in the presence of dynamical faults
type: Item
instance of: scholarly article
title: Optimal gossiping in geometric radio networks in the presence of dynamical faults
zbMATH Open document ID: 1242.68011
author: Angelo Monti
author: Francesco Pasquale
author: Andrea Clementi
author: Riccardo Silvestri
published in: Networks
publication date: 2012-06-29T00:00:00Z
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68M15
zbMATH DE Number: 6051060
zbMATH Keywords: ad-hoc radio networks
zbMATH Keywords: fault-tolerant protocols
zbMATH Keywords: gossiping
zbMATH Keywords: distributed protocols
Wikidata QID: Q58219148
MaRDI profile type: Publication
full work available at URL: net.21451
OpenAlex ID: W2015369690
cites work: Efficient communication strategies for ad hoc wireless networks
cites work: A lower bound for radio broadcast
cites work: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
cites work: Multiple Communication in Multihop Radio Networks
cites work: Fast broadcasting and gossiping in radio networks
cites work: Unit disk graphs
cites work: Q2762500
cites work: Broadcasting in dynamic radio networks
cites work: Distributed broadcast in radio networks of unknown topology.
cites work: Round robin is optimal for fault-tolerant broadcasting on wireless networks
cites work: Broadcasting in geometric radio networks
cites work: On adaptive deterministic gossiping in ad hoc radio networks.
cites work: Faster communication in known topology radio networks
cites work: Power consumption in packet radio networks
cites work: Feasibility and complexity of broadcasting with random transmission failures
DOI: 10.1002/NET.21451
description: scientific article; zbMATH DE number 6051060