Abstract

Secure data aggregation in wireless sensor networks has two contrasting objectives, i) Efficiently collecting and aggregating data and ii) Aggregating the data securely. Many schemes do not take into account the possibility of corrupt aggregators and allow the aggregator to decrypt data in hop-by-hop algorithms. on the other hand, using public key cryptography for providing end to end security is not energy efficient. in this paper we present and analyze the performance of the secure hierarchical data aggregation algorithm which uses an efficient public key cryptosystem (elliptic curve cryptography) to achieve end to end security. Unlike many other secure data aggregation algorithms which require separate phases for secure aggregation and integrity verification, the secure hierarchical data aggregation algorithm does not require an additional phase for verification. This saves energy by avoiding additional transmissions and computational overhead on the sensor nodes. We present and implement the secure data aggregation algorithm on Mica2 and TelosB sensor network platforms and measure the execution time and energy consumption of various cryptographic functions. We have also simulated our algorithms to analyze how an end-to-end scheme increases the network lifetime. We experimentally analyze our algorithms based on parameters like throughput, end to end delay and resilience to node failures. © 2012 IEEE.

Department(s)

Computer Science

International Standard Book Number (ISBN)

978-076954713-8

Document Type

Article - Conference proceedings

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2024 Institute of Electrical and Electronics Engineers, All rights reserved.

Publication Date

13 Dec 2012

Download

Full Text Link

Share

 
COinS