Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound)
type: Item
instance of: scholarly article
title: Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound)
zbMATH Open document ID: 1259.68016
author: Martin Farach-Colton
author: Antonio Fernández Anta
author: Miguel A. Mosteiro
published in: Theoretical Computer Science
publication date: 2013-03-04T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 6140782
zbMATH Keywords: radio networks
zbMATH Keywords: sensor networks
zbMATH Keywords: gossiping
zbMATH Keywords: distributed algorithms
zbMATH Keywords: broadcast
zbMATH Keywords: convergecast
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.11.030
OpenAlex ID: W2137922115
DOI: 10.1016/J.TCS.2012.11.030
Recommended article: Sensor Network Gossiping or How to Break the Broadcast Lower Bound
Recommended article: On the optimality of general lower bounds for broadcasting and gossiping
Recommended article: Optimal algorithms for broadcast and gossip in the edge-disjoint modes
Recommended article: Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
Recommended article: Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks
Recommended article: Lower and upper bounds for minimum energy broadcast and sensing problems in sensor networks†
Recommended article: Q4737173
Recommended article: Nonlinear gossip algorithms for wireless sensor networks
Recommended article: A novel gossip-based sensing coverage algorithm for dense wireless sensor networks
description: scientific article; zbMATH DE number 6140782