skip to main content
10.1145/1180345.1180355acmconferencesArticle/Chapter ViewAbstractPublication PagesccsConference Proceedingsconference-collections
Article

Attack-resilient hierarchical data aggregation in sensor networks

Published:30 October 2006Publication History

ABSTRACT

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.

References

  1. M. Bellare, R. Guerin, and P. Rogaway. XOR MACs: New methods for message authentication using finite pseudorandom functions. In Proc. of the 15th Annual International Cryptology Conference on Advances in Cryptology - CRYPTO'95, pages 15--28, 1995.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. L. Buttyan, P. Schaffer, and I. Vajda. Resilient aggregation with attack detection in sensor networks. In Proc. of 2nd IEEE Workshop on Sensor Networks and Systems for Pervasive Computing, 2006.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. Considine, F. Li, G. Kollios, and J. Byers. Approximate aggregation techniques for sensor databases. In Proc. of IEEE Int'l Conf. on Data Engineering (ICDE), 2004.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. W. Du, J. Deng, Y. S. Han, and P. Varshney. A pairwise key pre-distribution scheme for wireless sensor networks. In Proc. of the 10th ACM Conference on Computer and Communications Security (CCS '03)., 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31(2):182--209, 1985.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. S. Ganeriwal and M. B. Sribastava. Reputation-based framework for highly integrity sensor networks. In Proc. of ACM Workshop on Security of Sensor and Adhoc Networks (SASN), Washington, DC, 2004.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. D. Ganesan, R. Govindan, S. Shenker, and D. Estrin. Highly-resilient energy-efficient multipath routing in wireless sensor networks. Mobile Comuting and Communication Review, 4(5):11--25, 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. L. Hu and D. Evans. Secure aggregation for wireless networks. In Proc. of Workshop on Security and Assurance in Ad hoc Networks., 2003.]]Google ScholarGoogle Scholar
  9. M. Jelasity, A. Montresor, and O. Babaoglu. Gossip-based aggregation in large dynamic networks. ACM Transactions on Computer Systems, 23(3):219--252, 2005.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. F. Koushanfar, M. Potkonjak, and A. Sangiovanni-Vincentelli. Fault tolerance techniques in wireless ad-hoc sensor networks. In Sensors 2002. Proceedings of IEEE, pages 1491--1496.]]Google ScholarGoogle Scholar
  11. S. Madden, M. J. Franklin, J.M. Hellerstein, and W. Hong. TAG: A tiny aggregation service for ad hoc sensor networks. In Proc. of 5th USENIX Symposium on Operating Systems Design and Implementation, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. A. Manjhi, S. Nath, and P. Gibbons. Tributeries and deltas: Efficient and robust aggregation in sensor network streams. In Proc. of ACM International Conference on Management of Data (SIGMOD), 2005.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Mica Motes. http://www.xbow.com.]]Google ScholarGoogle Scholar
  14. S. Nath, P. B. Gibbons, S. Seshan, and Z. Anderson. Synopsis diffusion for robust aggregation in sensor networks. In Proc. of the 2nd international conference on Embedded networked sensor systems (SenSys), 2004.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. A. Perrig, R. Szewczyk, V. Wen, D. Culler, and J. D. Tygar. SPINS: Security protocols for sensor networks. In Seventh Annual International Conference on Mobile Computing and Networks (MobiCOM), 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. B. Przydatek, D. Song, and A. Perrig. SIA: Secure information aggregation in sensor networks. In Proc. of the 1st international conference on Embedded networked sensor systems (SenSys), 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. D. Wagner. Resilient aggregation in sensor networks. In Proc. of ACM Workshop on Security of Sensor and Adhoc Networks (SASN), 2004.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Y. Yang, X. Wang, S. Zhu, and G. Cao. SDAP: A secure hop-by-hop data aggregation protocol for sensor networks. In Proc. of ACM MOBIHOC, 2006.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Y. Yao and J. E. Gehrke. The cougar approach to in-network query processing in sensor networks. ACM SIGMOD Record, 31(2):9--18, September 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Fan Ye, Haiyun Luo, Songwu Lu, and Lixia Zhang. Statistical en-route filtering of injected false data in sensor networks. In Proc. of IEEE Infocom, 2004.]]Google ScholarGoogle Scholar
  21. W. Zhang and G. Cao. Group rekeying for filtering false data in sensor networks: A predistribution and local collaboration-based approach. Proc. of IEEE Infocom, 2005.]]Google ScholarGoogle Scholar
  22. J. Zhao and R. Govindan. Understanding packet delivery performance in dense wireless sensor networks. In Proc. of the 1st international conference on Embedded networked sensor systems (SenSys), 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. J. Zhao, R. Govindan, and D. Estrin. Computing aggregates for monitoring sensor networks. In Proc. of the 2nd IEEE International Workshop on Sensor Network Protocols and Applications, 2003.]]Google ScholarGoogle ScholarCross RefCross Ref
  24. S. Zhu, S. Setia, and S. Jajodia. LEAP: Efficient security mechanisms for large-scale distributed sensor networks. In Proc. of the 10th ACM Conference on Computer and Communications Security (CCS '03)., 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. S. Zhu, S. Setia, S. Jajodia, and P. Ning. An interleaved hop-by-hop authentication scheme for filtering injected false data in sensor networks. In Proc. of IEEE Symposium on Security and Privacy, 2004.]]Google ScholarGoogle Scholar

Index Terms

  1. Attack-resilient hierarchical data aggregation in sensor networks

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              SASN '06: Proceedings of the fourth ACM workshop on Security of ad hoc and sensor networks
              October 2006
              186 pages
              ISBN:1595935541
              DOI:10.1145/1180345

              Copyright © 2006 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 30 October 2006

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Upcoming Conference

              CCS '24
              ACM SIGSAC Conference on Computer and Communications Security
              October 14 - 18, 2024
              Salt Lake City , UT , USA

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader