242 search results - page 10 / 49 » Approximately uniform random sampling in sensor networks |
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
ECAI
2004
Springer
14 years 24 days ago
2004
Springer
We present algorithms for the generation of uniformly distributed Bayesian networks with constraints on induced width. The algorithms use ergodic Markov chains to generate samples....
IPSN
2004
Springer
14 years 23 days ago
2004
Springer
In this paper, we study the optimal way of distributing sensors in a random field to minimize the estimation distortion. We show that this problem is equivalent to certain proble...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— Before a sensor network is deployed, it is important to determine how many sensors are required to achieve a certain coverage degree. The number of sensor required for maintain...
SAC
2010
ACM
14 years 2 months ago
2010
ACM
This work proposes and evaluates a sampling algorithm based on wavelet transforms with Coiflets basis to reduce the data sensed in wireless sensor networks applications. The Coi...