Shortest hop multipath algorithm for wireless sensor networks (Q418284)
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: Shortest hop multipath algorithm for wireless sensor networks |
scientific article; zbMATH DE number 6038731
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest hop multipath algorithm for wireless sensor networks |
scientific article; zbMATH DE number 6038731 |
Statements
Shortest hop multipath algorithm for wireless sensor networks (English)
0 references
28 May 2012
0 references
shortest hop path
0 references
braided multipath
0 references
data dissemination
0 references
routing
0 references
distributed spanning tree algorithms
0 references
\(\beta \) synchronizer
0 references
0 references
0 references
0.7623834609985352
0 references
0.7510573863983154
0 references
0.7317055463790894
0 references
0.7146570086479187
0 references
0.7121017575263977
0 references
