ACM Home Page
Please provide us with feedback. Feedback
SDAP: A Secure Hop-by-Hop Data Aggregation Protocol for Sensor Networks
Full text PdfPdf (925 KB)
Source
ACM Transactions on Information and System Security (TISSEC) archive
Volume 11 ,  Issue 4  (July 2008) table of contents
Article No. 18  
Year of Publication: 2008
ISSN:1094-9224
Authors
Yi Yang  Pennsylvania State University
Xinran Wang  Pennsylvania State University
Sencun Zhu  Pennsylvania State University
Guohong Cao  Pennsylvania State University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 43,   Downloads (12 Months): 392,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1380564.1380568
What is a DOI?

ABSTRACT

Hop-by-hop data aggregation is a very important technique for reducing the communication overhead and energy expenditure of sensor nodes during the process of data collection in a sensor network. However, because individual sensor readings are lost in the per-hop aggregation process, compromised nodes in the network may forge false values as the aggregation results of other nodes, tricking the base station into accepting spurious aggregation results. Here a fundamental challenge is how can the base station obtain a good approximation of the fusion result when a fraction of sensor nodes are compromised?

To answer this challenge, we propose SDAP, a Secure Hop-by-hop Data Aggregation Protocol for sensor networks. SDAP is a general-purpose secure data aggregation protocol applicable to multiple aggregation functions. The design of SDAP is based on the principles of divide-and-conquer and commit-and-attest. First, SDAP uses a novel probabilistic grouping technique to dynamically partition the nodes in a tree topology into multiple logical groups (subtrees) of similar sizes. A commitment-based hop-by-hop aggregation is performed in each group to generate a group aggregate. The base station then identifies the suspicious groups based on the set of group aggregates. Finally, each group under suspect participates in an attestation process to prove the correctness of its group aggregate. The aggregate by the base station is calculated over all the group aggregates that are either normal or have passed the attestation procedure. Extensive analysis and simulations show that SDAP can achieve the level of efficiency close to an ordinary hop-by-hop aggregation protocol while providing high assurance on the trustworthiness of the aggregation result. Last, prototype implementation on top of TinyOS shows that our scheme is practical on current generation sensor nodes such as Mica2 motes.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
 
4
5
 
6
7
 
8
Du, W., Deng, J., Han, Y. S., and Varshney, P. K. 2003b. A witness-based approach for data fusion assurance in wireless sensor networks. In Proceedings of the Global Telecommunications Conference (GLOBECOM'03).
9
10
 
11
Frank, G. 1969. Procedures for detecting outlying observations in samples. Technometrics 11, 1 (February), 1--21.
 
12
He, W., Liu, X., Nguyen, H., Nahrstedt, K., and Abdelzaher, T. 2007. PDA: Privacy-preserving data aggregation in wireless sensor networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'07).
13
 
14
Hu, L. and Evans, D. 2003. Secure aggregation for wireless networks. In Proceedings of the Workshop on Security and Assurance in Ad Hoc Networks (SASN'03).
 
15
16
17
 
18
Krishnamachari, B., Estrin, D., and Wicker, S. 2002. The impact of data aggregation in wireless sensor networks. In Proceedings of the International Workshop on Distributed Event-Based Systems, (DEBS'02). Vienna, Austria.
19
20
 
21
 
22
23
24
25
 
26
Rivest, R. L. 1995. The RC5 encryption algorithm. In Workshop on Fast Software Encryption (FSE'95). 86--96.
27
 
28
TinyKeyMan. http://discovery.csc.ncsu.edu/.
 
29
TinyOS. http://www.tinyos.net/.
30
31
 
32
Ye, F., Luo, H., Lu, S., and Zhang, L. 2004. Statistical en-route filtering of injected false data in sensor networks. In Proceedings of the Annual Joint Conference of IEEE Computer and Communications Societies (INFOCOM'04).
 
33
Zhang, W. and Cao, G. 2005. Group Rekeying for Filtering False Data in Sensor Networks: A Predistribution and Local Collaboration-Based Approach. In Proceedings of the Annual Joint Conference of IEEE Computer and Communications Societies (INFOCOM'05).
34
35
 
36
Zhu, S., Setia, S., Jajodia, S., and Ning, P. 2004. An interleaved hop-by-hop authentication scheme for filtering of injected false data in sensor networks. In Proceedings of IEEE Symposium on Security and Privacy (SP'04). 259--271.

Collaborative Colleagues:
Yi Yang: colleagues
Xinran Wang: colleagues
Sencun Zhu: colleagues
Guohong Cao: colleagues