Sdap: : a secure hop-by-hop data aggregation protocol for sensor networks
Cached
Download Links
- [mcn.cse.psu.edu]
- [mcn.cse.psu.edu]
- [www.cse.ust.hk]
- DBLP
Other Repositories/Bibliography
| Venue: | in MobiHoc, 2006 |
| Citations: | 55 - 5 self |
BibTeX
@INPROCEEDINGS{Yang_sdap::,
author = {Yi Yang and Xinran Wang and Sencun Zhu and Guohong Cao},
title = {Sdap: : a secure hop-by-hop data aggregation protocol for sensor networks},
booktitle = {in MobiHoc, 2006},
year = {},
pages = {356--367}
}
Years of Citing Articles
OpenURL
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-andconquer 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







