REBIVE: A Reliable Private Data Aggregation Scheme for Wireless Sensor Networks
Document Type
Conference Proceeding
Language
eng
Format of Original
6 p.
Publication Date
3-2011
Publisher
Association for Computing Machinery
Source Publication
Proceedings of the 2011 ACM Symposium on Applied Computing
Source ISSN
9781450301138
Original Item ID
doi: 10.1145/1982185.1982279
Abstract
An important topic addressed by the wireless sensor networks community over the last several years is the in-network data aggregation. It is significant as well as a challenging issue to provide reliable data aggregation scheme while preserving data privacy. However, in WSNs, achieving ideal data accuracy is complicated due to collision, heavy network traffic, processing delays and/or several attacks. The problem of gathering accurate integrated data will be further intensified if the environment is adverse. Hence how to attain data privacy and perfect data accuracy are two major challenges for data aggregation in wireless sensor networks. To address this problem, we propose in this paper a new privacy preserving data aggregation scheme. We present REBIVE (REliaBle prIVate data aggrEgation scheme). In REBIVE the data accuracy maintenance and data privacy protection mechanisms work cooperatively. Different from past research, our proposed solution have the following features: providing privacy preservation technique for individual sensor data and aggregated sensor data; maintaining perfect data accuracy for realistic environments; being highly efficient; and being robust to popular attacks launched in WSNs.
Recommended Citation
Rahman, Farzana; Hoque, Md. Endadul; and Ahamed, Sheikh Iqbal, "REBIVE: A Reliable Private Data Aggregation Scheme for Wireless Sensor Networks" (2011). Mathematics, Statistics and Computer Science Faculty Research and Publications. 68.
https://epublications.marquette.edu/mscs_fac/68
Comments
Published as part of the proceedings of the conference, 26th Annual Association for Computing Machinery (ACM) Symposium on Applied Computing, 2011: 439-444. DOI.