Skip to main content
SpringerLink
Log in

Secure and highly-available aggregation queries in large-scale sensor networks via set sampling

  • Published:
Distributed Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Aspnes, J., Blais, E., Demirbas, M., O’Donnell, R., Rudra, A., Uurtamo, S.: k + Decision trees. In: International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, Revised Selected Papers, vol. 6451 of Lecture Notes in Computer Science. Springer-Verlag, pp. 74–88 July (2010)

  2. Bar-Yehuda R., Goldreich O., Itai A.: On the time-complexity of broadcast in radio networks: an exponential gap between determinism and randomization. J. Comput. Syst. Sci. 45, 104–126 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  3. Ben-Asher Y., Newman I.: Decision trees with Boolean threshold queries. J. Comput. Syst. Sci. 51(3), 495–502 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  4. Buhrman H., De Wolf R.: Complexity measures and decision tree complexity: a survey. Theoretical Comput. Sci. 288(1), 21–43 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chan H., Perrig A., Przydatek B., Song D.: SIA: secure information aggregation in sensor networks. J. Comput. Security (Special Issue on Security of Ad Hoc and Sensor Networks) 15(1), 69–102 (2007)

    Google Scholar 

  6. Chan, H., Perrig, A., Song, D.: Secure hierarchical in-network aggregation for sensor networks. In: Proceedings of the ACM Conference on Computer and Communications Security (2006)

  7. Chen Z., Bai Z., Sinha B.K.: Ranked Set Sampling: Theory and Applications. Springer, New York (2003)

    Google Scholar 

  8. Dagum P., Karp R., Luby M., Ross S.: An optimal algorithm for Monte Carlo estimation. SIAM J. Comput. 29(5), 1484–1496 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  9. Deng J., Han R., Mishra S.: Limiting DoS attacks during multihop data delivery in wireless sensor networks. Int. J. Security Networks, (Special Issue on Security Issues in Sensor Networks) 1(1/2), 167–178 (2006)

    Google Scholar 

  10. Du, W., Deng, J., Han, Y., Varshney, P.K.: A witness-based approach for data fusion assurance in wireless sensor networks. In: Proceedings of Global Telecommunications Conference (2003)

  11. Du, W., Wang, R., Ning, P.: An efficient scheme for authenticating public keys in sensor networks. In: Proceedings of the ACM Symposium on Mobile Ad Hoc Networking and Computing (2005)

  12. Dubhashi D.: Simple proofs of occupancy tail bounds. Random Struct. Algorithms 11(2), 119–123 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  13. Estan C., Varghese G., Fisk M.: Bitmap algorithms for counting active flows on high-speed links. IEEE/ACM Trans. Networking 14(5), 925–937 (2006)

    Article  Google Scholar 

  14. Flajolet P., Martin G.N.: Probabilistic counting algorithms for database applications. J. Comput. Syst. Sci. 31(2), 182–209 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  15. Frikken, K., Dougherty, J.: An efficient Integrity-preserving Scheme for Hierarchical Sensor Aggregation. In: Proceedings of the ACM Conference on Wireless Network Security (2008)

  16. Gandhi, S., Suri, S., Welzl, E.: Catching elephants with mice: sparse sampling for monitoring sensor networks. In: SenSys (2007)

  17. Garofalakis, M., Hellerstein, J.M., Maniatis, P.: Proof sketches: verifiable in-network aggregation. In: Proceedings of the International Conference on Data Engineering (2007)

  18. Gura, N. Patel, A., Wander, A., Eberle, H., Shantz, S.C.: Comparing elliptic curve cryptography and RSA on 8-bit CPUs. In: Proceedings of the International Workshop on Cryptographic Hardware and Embedded Systems (2004)

  19. Hu, L., Evans, D.: Secure aggregation for wireless networks. In: Proceedings of Workshop on Security and Assurance in Ad hoc Networks (2003)

  20. Jadia, P., Mathuria, A.: Efficient secure aggregation in sensor networks. In: Proceedings of the 11th International Conference on High Performance Computing (2004)

  21. Kamath A., Motwani R., Palem K., Spirakis P.: Tail bounds for occupancy and the satisfiability threshold conjecture. Random Struct. Algorithms 7(1), 59–80 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  22. Madden, S., Franklin, M., Hellerstein, J., Hong, W.: TAG: A tiny aggregation service for Ad-Hoc sensor networks. In: Proceedings of the Symposium on Operating Systems Design and Implementation (2002)

  23. Mahimkar, A., Rappaport, T.: SecureDAV: a secure data aggregation and verification protocol for sensor networks. In: Proceedings of the IEEE Global Telecommunications Conference (2004)

  24. Mitzenmacher M., Upfal E.: Probability and Computing—Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge, England (2005)

    MATH  Google Scholar 

  25. Nath, S., Gibbons, P.B., Seshan, S., Anderson, Z.: Synopsis diffusion for robust aggregation in sensor networks. In: SenSys (2004)

  26. Nath, S., Yu, H.: Secure outsourced aggregation via one-way chains. In: ACM SIGMOD June 2009

  27. Ning P., Liu A., Du W.: Mitigating DoS attacks against broadcast authentication in wireless sensor networks. ACM Trans. Sensor Networks 4(1), 1–35 (2008)

    Article  Google Scholar 

  28. Perrig A., Szewczyk R., Wen V., Culler D., Tygar D.: SPINS: Security protocols for sensor networks. Wireless Networks J. (WINE) 8(5), 521–534 (2002)

    Article  MATH  Google Scholar 

  29. Roy, S., Setia, S., Jajodia, S.: Attack-resilient hierarchical data aggregation in sensor networks. In: Proceedings of the ACM Workshop on Security of Ad Hoc and Sensor Networks (2006)

  30. Wagner, D.: Resilient aggregation in sensor networks. In: Proceedings of the ACM Workshop on Security of Ad hoc and Sensor Networks (2004)

  31. Wang, R., Du, W., Ning, P.: Containing denial-of-service attacks in broadcast authentication in sensor networks. In: Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (2007)

  32. Wang, Y., Attebury, G., Ramamurthy, B.: A survey of security issues in wireless sensor networks. IEEE. Commun. Surveys Tutorials 8(2) (2006)

  33. Yang, Y., Wang, X., Zhu, S., Cao, G.: SDAP: a secure Hop-by-Hop data aggregation protocol for sensor networks. In: Proceedings of ACM Symposium on Mobile Ad hoc Networking and Computing (2006)

  34. Yu, H.: Secure and highly-available aggregation queries in large-scale sensor networks via set sampling. In: ACM/IEEE IPSN (2009)

Download references

Author information

Authors and Affiliations

  1. School of Computing, National University of Singapore, Computing 1, 13 Computing Drive, Singapore, 117417, Republic of Singapore

    Haifeng Yu

Authors
  1. Haifeng Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Haifeng Yu.

Additional information

This work is partly supported by Young Investigator Award R-252-000-334-101 from National University of Singapore. A preliminary conference version of this paper appeared as [34].

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yu, H. Secure and highly-available aggregation queries in large-scale sensor networks via set sampling. Distrib. Comput. 23, 373–394 (2011). https://doi.org/10.1007/s00446-011-0130-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-011-0130-z

Keywords

Search

Navigation