Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound) (Q1939254)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound) |
scientific article; zbMATH DE number 6140782
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound) |
scientific article; zbMATH DE number 6140782 |
Statements
Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound) (English)
0 references
4 March 2013
0 references
radio networks
0 references
sensor networks
0 references
gossiping
0 references
distributed algorithms
0 references
broadcast
0 references
convergecast
0 references
0.93256867
0 references
0.87806916
0 references
0.86980975
0 references
0.8647756
0 references
0.86230665
0 references
0.85821867
0 references
0.8534699
0 references
