Please use this identifier to cite or link to this item:
|Title:||Secure and highly-available aggregation queries in large-scale sensor networks via set sampling|
Secure aggregation queries
|Citation:||Yu, H. (2011). Secure and highly-available aggregation queries in large-scale sensor networks via set sampling. Distributed Computing 23 (5-6) : 373-394. ScholarBank@NUS Repository. https://doi.org/10.1007/s00446-011-0130-z|
|Abstract:||Wireless sensor networks are often queried for aggregates such as predicate count, sum, and average. In untrusted environments, sensors may potentially be compromised. Existing approaches for securely answering aggregation queries in untrusted sensor networks can detect whether the aggregation result is corrupted by an attacker. However, the attacker (controlling the compromised sensors) can keep corrupting the result, rendering the system unavailable. This paper aims to enable aggregation queries to tolerate instead of just detecting the adversary. To this end, we propose a novel tree sampling algorithm that directly uses sampling to answer aggregation queries. It leverages a set sampling protocol to overcome a well-known obstacle in sampling-traditional sampling technique is only effective when the predicate count or sum is large. Set sampling can efficiently sample a set of sensors together, and determine whether any sensor in the set satisfies the predicate (but not how many). With set sampling as a building block, tree sampling can provably generate a correct answer despite adversarial interference, while without the drawbacks of traditional sampling techniques. © 2011 Springer-Verlag.|
|Source Title:||Distributed Computing|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 25, 2019
WEB OF SCIENCETM
checked on Mar 18, 2019
checked on Mar 17, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.