Sciweavers

212 search results - page 21 / 43
» Probabilistic Self-Localization for Sensor Networks
Sort
View
SIGGRAPH
1993
ACM
13 years 11 months ago
Sensor-actuator networks
Sensor-actuator networks (SANs) are a new approach for the physically-based animation of objects. The user supplies the configuratíon of a mechanical system that hás been augmen...
Michiel van de Panne
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 11 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
ICDCS
2010
IEEE
13 years 8 months ago
Link-Centric Probabilistic Coverage Model for Transceiver-Free Object Detection in Wireless Networks
Abstract--Sensing coverage is essential for most applications in wireless networks. In traditional coverage problem study, the disk coverage model has been widely applied because o...
Dian Zhang, Yunhuai Liu, Lionel M. Ni
IWCMC
2006
ACM
14 years 1 months ago
Multipath fading in wireless sensor networks: measurements and interpretation
Multipath fading heavily contributes to the unreliability of wireless links, causing fairly large deviations from link quality predictions based on path loss models; its impact on...
Daniele Puccinelli, Martin Haenggi
IJRR
2006
145views more  IJRR 2006»
13 years 7 months ago
Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology
ABSTRACT. We introduce tools from computational homology to verify coverage in an idealized sensor network. Our methods are unique in that, while they are coordinate-free and assum...
V. de Silva, R. Ghrist