Secure Data Aggregation Using Clusters in Sensor Networks

Wireless sensor network can be applied to both abominable and military environments. A primary goal in the design of wireless sensor networks is lifetime maximization, constrained by the energy capacity of batteries. One well-known method to reduce energy consumption in such networks is data aggregation. Providing efcient data aggregation while preserving data privacy is a challenging problem in wireless sensor networks research. In this paper, we present privacy-preserving data aggregation scheme for additive aggregation functions. The Cluster-based Private Data Aggregation (CPDA)leverages clustering protocol and algebraic properties of polynomials. It has the advantage of incurring less communication overhead. The goal of our work is to bridge the gap between collaborative data collection by wireless sensor networks and data privacy. We present simulation results of our schemes and compare their performance to a typical data aggregation scheme TAG, where no data privacy protection is provided. Results show the efficacy and efficiency of our schemes.




References:
[1] C. Intanagonwiwat, D. Estrin, R. Govindan, and J. Heidemann, "Impact
of Network Density on Data Aggregation in Wireless Sensor Networks,"
In Proceedings of the 22nd International Conference on Distributed
Computing Systems, 2002.
[2] X. Tang and J. Xu, "Extending network lifetime for precision constrained
data aggregation in wireless sensor networks," INFOCOM, 2006.
[3] Y. Yang, X. Wang, S. Zhu, and G. Cao, "SDAP: A Secure Hop-by-
Hop Data Aggregation Protocol for Sensor Networks," in Proc. ACM
MobiHoc, 2006.
[4] D. Wagner, "Resilient Aggregation in Sensor Networks," In Proceedings
of the 2nd ACM Workshop on Security of Ad Hoc and Sensor Networks,
2051.
[5] J. Girao, D. Westhoff, and M. Schneider, "CDA: Concealed Data
Aggregation for Reverse Multicast Trafc in Wireless Sensor Networks,"
in 40th International Conference on Communications, IEEE ICC, May
2005.
[6] C. Castelluccia, E. Mykletun, and G. Tsudik, "Efcient Aggregation of
Encrypted Data in Wireless Sensor Networks," 2005.
[7] A. Goel and D. Estrin, "Simultaneous Optimization for Concave Costs:
Single Sink Aggregation or Single Source Buy-at-Bulk," in Proc. 14th
Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), 2003.
[8] S. Madden, M. Franklin, J. Hellerstein, "TAG: a Tiny AGgregation Service
for Adhoc Sensor Networks," in in Proc. of the 33rd International
Conference on OSDI, December 2002.
[9] N. Alon, R.M. Karp, D. Peleg, and D. West, "A Graph Theoretic Game
and Its Application to the K-Server Problem," in SIAM J. Computing,
vol. 24, 1995.
[10] W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy
efcient communication protocol for wireless microsensor networks,"
in in Proc. of the 33rd International Conference on System Sciences
(HICSS00), January 2000.
[11] J. Heidemann, F. Silva, C. Intanagonwiwat, R. Govindan, D. Es- trin
and D. Ganesan, "Building ecient wireless sensor networks with lowlevel
naming," in Proceedings of the eighteenth ACM Symposium on
Operating Systems Principles (SOSP01), pp. 146-159, 2001.
[12] B. Krishnamachari, D. Estrin and S. Wicker, "Impact of Data Aggregation
in Wireless Sensor Networks," in Preceedings of the 22nd
International Conference on Distributed Computing Systems Workshops
(ICDCSW02), pp. 575-578, 2002.
[13] K.W. Fan, S. Liu, and P. Sinha, "On the Potential of Structure-Free Data
Aggregation in Sensor Networks," in Proc. IEEE INFOCOM 06, Apr
2006.