Secure and energy-efficient data aggregation with malicious aggregator identification in wireless sensor networks

Li, Hongjuan, Li, Keqiu, Qu, Wenyu and Stojmenovic, Ivan 2014, Secure and energy-efficient data aggregation with malicious aggregator identification in wireless sensor networks, Future generation computer systems, vol. 37, pp. 108-116, doi: 10.1016/j.future.2013.12.021.

Attached Files
Name Description MIMEType Size Downloads

Title Secure and energy-efficient data aggregation with malicious aggregator identification in wireless sensor networks
Author(s) Li, Hongjuan
Li, Keqiu
Qu, Wenyu
Stojmenovic, Ivan
Journal name Future generation computer systems
Volume number 37
Start page 108
End page 116
Total pages 9
Publisher Elsevier
Place of publication Amsterdam, The Netherlands
Publication date 2014-07
ISSN 0167-739X
Keyword(s) wireless sensor networks
data aggregation
security
malicious aggregator identification
Summary Data aggregation in wireless sensor networks is employed to reduce the communication overhead and prolong the network lifetime. However, an adversary may compromise some sensor nodes, and use them to forge false values as the aggregation result. Previous secure data aggregation schemes have tackled this problem from different angles. The goal of those algorithms is to ensure that the Base Station (BS) does not accept any forged aggregation results. But none of them have tried to detect the nodes that inject into the network bogus aggregation results. Moreover, most of them usually have a communication overhead that is (at best) logarithmic per node. In this paper, we propose a secure and energy-efficient data aggregation scheme that can detect the malicious nodes with a constant per node communication overhead. In our solution, all aggregation results are signed with the private keys of the aggregators so that they cannot be altered by others. Nodes on each link additionally use their pairwise shared key for secure communications. Each node receives the aggregation results from its parent (sent by the parent of its parent) and its siblings (via its parent node), and verifies the aggregation result of the parent node. Theoretical analysis on energy consumption and communication overhead accords with our comparison based simulation study over random data aggregation trees.
Language eng
DOI 10.1016/j.future.2013.12.021
Field of Research 080303 Computer System Security
080503 Networking and Communications
0805 Distributed Computing
0806 Information Systems
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category C1.1 Refereed article in a scholarly journal
ERA Research output type C Journal article
Copyright notice ©2013, Elsevier B.V.
Persistent URL http://hdl.handle.net/10536/DRO/DU:30073179

Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 6 times in TR Web of Science
Scopus Citation Count Cited 16 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 79 Abstract Views, 1 File Downloads  -  Detailed Statistics
Created: Fri, 28 Aug 2015, 13:18:21 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.