Research Article | OPEN ACCESS
Secure Data Aggregation Using Reliable Nodes for Wireless Sensor Networks
1, 2M.Y. Mohamed Yacoab and 3V. Sundaram
1Karpagam University, Coimbatore, India
2MEASI Institute of Information Technology, Chennai, India
3Karpagam College of Engineering, Coimbatore, India
Research Journal of Applied Sciences, Engineering and Technology 2013 5:768-775
Received: August 30, 2012 | Accepted: October 03, 2012 | Published: June 25, 2013
Abstract
Generally, aggregation techniques in Wireless Sensor Networks (WSNs) are defenseless against various attacks. The aggregator and aggregated data has to be secured to assure integrity and confidentiality. In this study, we propose a secure data aggregation technique with reliable nodes using key predicate test protocol for sensor network. This technique specialize some nodes as Reliable nodes (R-nodes) to monitor the process of aggregation. Initially, for each node, a secret key is shared between base station and neighboring nodes. Then, an aggregation tree is constructed for transmitting data to the base station in a hierarchical fashion. The aggregator encrypts the data using secret key and forwards to a level up aggregator in aggregation tree. By enhancing broadcasting feature of R-nodes, the aggregated value is verified for ensuring integrity. As keys are shared between neighboring nodes, the nodes are validated using self-key predicate test. The proposed technique is proved through simulation results. It increases the throughput by reducing the packet drops significantly.
Keywords:
Data aggregation, integrity, reliable nodes, secret key, transmission,
Competing interests
The authors have no competing interests.
Open Access Policy
This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Copyright
The authors have no competing interests.
|
|
|
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
|
Information |
|
|
|
Sales & Services |
|
|
|