Abstract
Hop-by-hop data aggregation is a very important technique used to reduce the communication overhead and energy expenditure of sensor nodes during the process of data collection in a wireless sensor network (WSN). However, the unattended nature of WSNs calls for data aggregation techniques to be secure. Indeed, sensor nodes can be compromised to mislead the base station (BS) by injecting bogus data into the network during both forwarding and aggregation of data. Moreover, data aggregation might increase the risk of confidentiality violations: If sensors close to the BS are corrupted, an adversary could easily access to the results of the 'in network' computation performed by the WSN. Further, nodes can also fail due to random and non-malicious causes (e.g., battery exhaustion), hence availability should be considered as well. In this paper we tackle the above issues that affect data aggregation techniques by proposing a mechanism that: (i) provides both confidentiality and integrity of the aggregated data so that for any compromised sensor in the WSN the information acquired could only reveal the readings performed by a small, constant number of neighboring sensors of the compromised one; (ii) detects bogus data injection attempts; (iii) provides high resilience to sensor failures. Our protocol is based on the concept of delayed aggregation and peer monitoring and requires local interactions only. Hence, it is highly scalable and introduces small overhead; detailed analysis supports our findings. Copyright © 2009 John Wiley & Sons, Ltd.
Original language | English (US) |
---|---|
Pages (from-to) | 181-194 |
Number of pages | 14 |
Journal | Security and Communication Networks |
Volume | 2 |
Issue number | 2 |
DOIs | |
State | Published - Jan 1 2009 |
Externally published | Yes |
Bibliographical note
Generated from Scopus record by KAUST IRTS on 2023-09-20ASJC Scopus subject areas
- Information Systems
- Computer Networks and Communications