PDA: Privacy-preserving data aggregation in wireless sensor networks

被引:241
作者
He, Wenbo [1 ]
Liu, Xue [2 ]
Nguyen, Hoang [1 ]
Nahrstedt, Klara [1 ]
Abdelzaher, Tarek [1 ]
机构
[1] Univ Illinois, Dept Comp Sci, Urbana, IL 61801 USA
[2] McGill Univ, Sch Comp Sci, Montreal, PQ H3A 2A7, Canada
来源
INFOCOM 2007, VOLS 1-5 | 2007年
基金
中国国家自然科学基金;
关键词
D O I
10.1109/INFCOM.2007.237
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Providing efficient data aggregation while preserving data privacy is a challenging problem in wireless sensor networks research. In this paper, we present two privacy-preserving data aggregation schemes for additive aggregation functions. The first scheme - Cluster-based Private Data Aggregation (CPDA)-leverages clustering protocol and algebraic properties of polynomials. It has the advantage of incurring less communication overhead. The second scheme - Slice-Mir-AggRegaTe (SMART)builds on slicing techniques and the associative property of addition. It has the advantage of incurring less computation overhead. The goal of our work is to bridge the gap between collaborative data collection by wireless sensor networks and data privacy. We assess the two schemes by privacy-preservation efficacy, communication overhead, and data aggregation accuracy. 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. To the best of our knowledge, this paper is among the first on privacy-preserving data aggregation in wireless sensor networks.
引用
收藏
页码:2045 / +
页数:2
相关论文
共 26 条
[1]  
AGRAWAL R, 2000, SIGMOD C, P439, DOI DOI 10.1145/342009.335438
[2]  
[Anonymous], 2004, P ACM C EMB NETW SEN
[3]  
[Anonymous], P 8 ACM SIGKDD INT C
[4]  
CASTELLUCCIA C, 2005, MOBIQUITOS
[5]  
Culler D., 2004, IEEE COMPUTER
[6]  
DESHPANDE A, 2003, SIGMOD
[7]  
Du W., 2001, P 2001 WORKSH NEW SE, P13, DOI DOI 10.1145/508171.508174
[8]  
Eschenauer L., 2002, Proceedings of the ACM Conference on Computer and Communications Security, P41, DOI [10.1145/586110.586117, DOI 10.1145/586110.586117]
[9]  
GIRAO J, 2005, 40 INT C COMM IEEE I
[10]  
Halpern J., 2004, P 36 ANN ACM S THEOR, P623, DOI DOI 10.1145/1007352.1007447