Sciweavers

55 search results - page 6 / 11
» Model-based approximate querying in sensor networks
Sort
View
WIOPT
2006
IEEE
14 years 1 months ago
Optimizing data replication for expanding ring-based queries in wireless sensor networks
We consider the problem of optimizing the number of replicas for event information in wireless sensor networks, when queries are disseminated using expanding rings. We obtain clos...
Bhaskar Krishnamachari, Joon Ahn
SENSYS
2003
ACM
14 years 7 days ago
SIA: secure information aggregation in sensor networks
Sensor networks promise viable solutions to many monitoring problems. However, the practical deployment of sensor networks faces many challenges imposed by real-world demands. Sen...
Bartosz Przydatek, Dawn Xiaodong Song, Adrian Perr...
INFOCOM
2005
IEEE
14 years 18 days ago
Power aware routing for sensor databases
— Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensor network databases like TinyDB [1] are the dominant architectures...
Chiranjeeb Buragohain, Divyakant Agrawal, Subhash ...
ICDE
2004
IEEE
148views Database» more  ICDE 2004»
14 years 8 months ago
Approximate Selection Queries over Imprecise Data
We examine the problem of evaluating selection queries over imprecisely represented objects. Such objects are used either because they are much smaller in size than the precise on...
Iosif Lazaridis, Sharad Mehrotra
DC
2008
13 years 7 months ago
Approximate distributed top- k queries
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
Boaz Patt-Shamir, Allon Shafrir