279 search results - page 47 / 56 » Randomized k-Coverage Algorithms For Dense Sensor Networks |
GISCIENCE
2008
Springer
13 years 8 months ago
2008
Springer
Movement patterns, like flocking and converging, leading and following, are examples of high-level process knowledge derived from lowlevel trajectory data. Conventional techniques...
MOBICOM
2003
ACM
14 years 26 days ago
2003
ACM
Wireless Sensor Networks have been proposed for a multitude of location-dependent applications. For such systems, the cost and limitations of the hardware on sensing nodes prevent...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
CN
2010
13 years 7 months ago
2010
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
MOBIHOC
2005
ACM
14 years 7 months ago
2005
ACM
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...