A Distributed Algorithm to Approximate Node-Weighted Minimum α-Connected (θ,k)-Coverage in Dense Sensor Networks (Q3507337)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Distributed Algorithm to Approximate Node-Weighted Minimum α-Connected (θ,k)-Coverage in Dense Sensor Networks |
scientific article |
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
