A Distributed Algorithm to Approximate Node-Weighted Minimum α-Connected (θ,k)-Coverage in Dense Sensor Networks (Q3507337)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5290804
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Distributed Algorithm to Approximate Node-Weighted Minimum α-Connected (θ,k)-Coverage in Dense Sensor Networks |
scientific article; zbMATH DE number 5290804 |
Statements
A Distributed Algorithm to Approximate Node-Weighted Minimum α-Connected (θ,k)-Coverage in Dense Sensor Networks (English)
0 references
19 June 2008
0 references
probabilistic model
0 references
(\(\theta \) and \(k\))-coverage
0 references
\(\alpha \)-connectivity
0 references
dense sensor networks
0 references
0.7956726551055908
0 references
0.7886402606964111
0 references
0.7863014340400696
0 references
0.784091591835022
0 references
0.7813225388526917
0 references
