Sciweavers

21 search results - page 1 / 5
» Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sort
View
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
13 years 10 months ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
OPODIS
2007
13 years 6 months ago
Deterministic Communication in the Weak Sensor Model
In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collisio...
Antonio Fernández Anta, Miguel A. Mosteiro,...
WADS
2007
Springer
96views Algorithms» more  WADS 2007»
13 years 10 months ago
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
Abstract. Assumptions about node density in the Sensor Networks literature are frequently too strong or too weak. Neither absolutely arbitrary nor uniform deployment seem feasible ...
Martin Farach-Colton, Miguel A. Mosteiro
PERCOM
2007
ACM
14 years 4 months ago
Structural Learning of Activities from Sparse Datasets
Abstract. A major challenge in pervasive computing is to learn activity patterns, such as bathing and cleaning from sensor data. Typical sensor deployments generate sparse datasets...
Fahd Albinali, Nigel Davies, Adrian Friday
ICASSP
2010
IEEE
13 years 4 months ago
Particle filter adaptation for distributed sensors via set membership
A distributed set-membership-constrained particle filter (SMCPF) is developed for decentralized tracking applications using wireless sensor networks. Unlike existing PF alternati...
Shahrokh Farahmand, Stergios I. Roumeliotis, Georg...