SDAP

A Secure hop-by-hop Data Aggregation Protocol for sensor networks

Yi Yang, Xinran Wang, Sencun Zhu, Guohong Cao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

178 Citations (Scopus)

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 perhop 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. 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. Our analysis and simulations show that SDAP can achieve the level of efficiency close to an ordinary hop-by-hop aggregation protocol while providing certain assurance on the trustworthiness of the aggregation result. Moreover, SDAP is a general-purpose secure aggregation protocol applicable to multiple aggregation functions.

Original languageEnglish (US)
Title of host publicationProceedings of the Seventh ACM International Symposium on Mobile Ad Hoc Networking and Computing, MOBIHOC 2006
Pages356-367
Number of pages12
Volume2006
StatePublished - Sep 4 2006
Event7th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MOBIHOC 2006 - Florence, Italy
Duration: May 22 2006May 25 2006

Other

Other7th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MOBIHOC 2006
CountryItaly
CityFlorence
Period5/22/065/25/06

Fingerprint

Sensor networks
Agglomeration
Network protocols
Base stations
Sensor nodes
Fusion reactions
Topology
Communication
Sensors

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Yang, Y., Wang, X., Zhu, S., & Cao, G. (2006). SDAP: A Secure hop-by-hop Data Aggregation Protocol for sensor networks. In Proceedings of the Seventh ACM International Symposium on Mobile Ad Hoc Networking and Computing, MOBIHOC 2006 (Vol. 2006, pp. 356-367)
Yang, Yi ; Wang, Xinran ; Zhu, Sencun ; Cao, Guohong. / SDAP : A Secure hop-by-hop Data Aggregation Protocol for sensor networks. Proceedings of the Seventh ACM International Symposium on Mobile Ad Hoc Networking and Computing, MOBIHOC 2006. Vol. 2006 2006. pp. 356-367
@inproceedings{255788a1cb5946cab2a2ad9e49c36c16,
title = "SDAP: A Secure hop-by-hop Data Aggregation Protocol for sensor networks",
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 perhop 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. 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. Our analysis and simulations show that SDAP can achieve the level of efficiency close to an ordinary hop-by-hop aggregation protocol while providing certain assurance on the trustworthiness of the aggregation result. Moreover, SDAP is a general-purpose secure aggregation protocol applicable to multiple aggregation functions.",
author = "Yi Yang and Xinran Wang and Sencun Zhu and Guohong Cao",
year = "2006",
month = "9",
day = "4",
language = "English (US)",
isbn = "1595933689",
volume = "2006",
pages = "356--367",
booktitle = "Proceedings of the Seventh ACM International Symposium on Mobile Ad Hoc Networking and Computing, MOBIHOC 2006",

}

Yang, Y, Wang, X, Zhu, S & Cao, G 2006, SDAP: A Secure hop-by-hop Data Aggregation Protocol for sensor networks. in Proceedings of the Seventh ACM International Symposium on Mobile Ad Hoc Networking and Computing, MOBIHOC 2006. vol. 2006, pp. 356-367, 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MOBIHOC 2006, Florence, Italy, 5/22/06.

SDAP : A Secure hop-by-hop Data Aggregation Protocol for sensor networks. / Yang, Yi; Wang, Xinran; Zhu, Sencun; Cao, Guohong.

Proceedings of the Seventh ACM International Symposium on Mobile Ad Hoc Networking and Computing, MOBIHOC 2006. Vol. 2006 2006. p. 356-367.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - SDAP

T2 - A Secure hop-by-hop Data Aggregation Protocol for sensor networks

AU - Yang, Yi

AU - Wang, Xinran

AU - Zhu, Sencun

AU - Cao, Guohong

PY - 2006/9/4

Y1 - 2006/9/4

N2 - 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 perhop 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. 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. Our analysis and simulations show that SDAP can achieve the level of efficiency close to an ordinary hop-by-hop aggregation protocol while providing certain assurance on the trustworthiness of the aggregation result. Moreover, SDAP is a general-purpose secure aggregation protocol applicable to multiple aggregation functions.

AB - 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 perhop 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. 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. Our analysis and simulations show that SDAP can achieve the level of efficiency close to an ordinary hop-by-hop aggregation protocol while providing certain assurance on the trustworthiness of the aggregation result. Moreover, SDAP is a general-purpose secure aggregation protocol applicable to multiple aggregation functions.

UR - http://www.scopus.com/inward/record.url?scp=33748089962&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33748089962&partnerID=8YFLogxK

M3 - Conference contribution

SN - 1595933689

SN - 9781595933683

VL - 2006

SP - 356

EP - 367

BT - Proceedings of the Seventh ACM International Symposium on Mobile Ad Hoc Networking and Computing, MOBIHOC 2006

ER -

Yang Y, Wang X, Zhu S, Cao G. SDAP: A Secure hop-by-hop Data Aggregation Protocol for sensor networks. In Proceedings of the Seventh ACM International Symposium on Mobile Ad Hoc Networking and Computing, MOBIHOC 2006. Vol. 2006. 2006. p. 356-367