Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
SPINS: security protocols for sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
The cougar approach to in-network query processing in sensor networks
ACM SIGMOD Record
XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Secure Aggregation for Wireless Networks
SAINT-W '03 Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT'03 Workshops)
A pairwise key pre-distribution scheme for wireless sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
LEAP: efficient security mechanisms for large-scale distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Understanding packet delivery performance in dense wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
SIA: secure information aggregation in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Approximate Aggregation Techniques for Sensor Databases
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Reputation-based framework for high integrity sensor networks
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Resilient aggregation in sensor networks
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Synopsis diffusion for robust aggregation in sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Tributaries and deltas: efficient and robust aggregation in sensor network streams
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
SDAP: a secure hop-by-Hop data aggregation protocol for sensor networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
SDAP: A Secure Hop-by-Hop Data Aggregation Protocol for Sensor Networks
ACM Transactions on Information and System Security (TISSEC)
Robust aggregation in peer-to-peer database systems
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Securely computing an approximate median in wireless sensor networks
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Secure median computation in wireless sensor networks
Ad Hoc Networks
Secure and highly-available aggregation queries in large-scale sensor networks via set sampling
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Opportunistic sensing: security challenges for the new paradigm
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Prisense: privacy-preserving data aggregation in people-centric urban sensing systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
Secure Distributed Data Aggregation
Foundations and Trends in Databases
Hi-index | 0.00 |
In a large sensor network, in-network data aggregation, i.e., combining partial results at intermediate nodes during message routing, significantly reduces the amount of communication and hence the energy consumed. Recently several researchers have proposed robust aggregation frameworks, which combine multi-path routing schemes with duplicate-insensitive algorithms, to accurately compute aggregates (e.g., Sum, Count, Average) in spite of message losses resulting from node and transmission failures. However, these aggregation frameworks have been designed without security in mind. Given the lack of hardware support for tamper-resistance and the unattended nature of sensor nodes, sensor networks are highly vulnerable to node compromises. We show that even if a few compromised nodes contribute false sub-aggregate values, this results in large errors in the aggregate computed at the root of the hierarchy. We present modifications to the aggregation algorithms that guard against such attacks, i.e., we present algorithms for resilient hierarchical data aggregation despite the presence of compromised nodes in the aggregation hierarchy. We evaluate the performance and costs of our approach via both analysis and simulation. Our results show that our approach is scalable and efficient.