Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound) (Q1939254): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.11.030 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2137922115 / rank | |||
Normal rank | |||
Latest revision as of 00:49, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound) |
scientific article |
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
