Sciweavers

373 search results - page 66 / 75
» Minimum-hot-spot query trees for wireless sensor networks
Sort
View
SENSYS
2004
ACM
14 years 1 months ago
Synopsis diffusion for robust aggregation in sensor networks
Previous approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-count...
Suman Nath, Phillip B. Gibbons, Srinivasan Seshan,...
WICON
2008
13 years 9 months ago
Risk-aware beacon scheduling for tree-based ZigBee/IEEE 802.15.4 wireless networks
In a tree-based ZigBee network, ZigBee routers (ZRs) must schedule their beacon transmission times to avoid beacon collisions. The beacon schedule determines packet delivery laten...
Li-Hsing Yen, Yee Wei Law, Marimuthu Palaniswami
ICCSA
2007
Springer
14 years 2 months ago
Provably Secure Framework for Information Aggregation in Sensor Networks
Information aggregation is an important operation in wireless sensor networks executed for the purpose of monitoring and reporting of the environmental data. Due to the performance...
Mark Manulis, Jörg Schwenk
VLDB
2004
ACM
134views Database» more  VLDB 2004»
14 years 1 months ago
Model-Driven Data Acquisition in Sensor Networks
Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that “the sensornet is a database” is problematic,...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...
AAIM
2009
Springer
98views Algorithms» more  AAIM 2009»
14 years 2 months ago
Latency Constrained Aggregation in Chain Networks Admits a PTAS
This paper studies the aggregation of messages in networks that consist of a chain of nodes, and each message is time-constrained such that it needs to be aggregated during a give...
Tim Nonner, Alexander Souza