2 search results - page 1 / 1 » Locating sensors in paths and cycles: The case of 2-identify... |
EJC
2008
13 years 2 months ago
2008
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
IPSN
2005
Springer
13 years 9 months ago
2005
Springer
— We consider a sensor network measuring correlated data, where the task is to gather all data from the network nodes to a sink. We consider the case where data at nodes is lossy...