ADA: Authenticated Data Aggregation in Wireless Sensor Networks

  title={ADA: Authenticated Data Aggregation in Wireless Sensor Networks},
  author={E. G. Prathima and T. Shiv Prakash and Kuppanna Rajuk Venugopal and S. Sitharama Iyengar and Lalit M. Patnaik},
  journal={International Journal of Computer Applications},
Wireless Sensor Networks are vulnerable to communication failures and security attacks. It is quite challenging to provide security to data aggregation. This paper proposes Authenticated Data Aggregation for Wireless Sensor Networks, where the nodes organize themselves into tiers around the sink. Message Authentication Code (MAC) is generated and transmitted along with the synopsis to ensure integrity. All nodes in the network store the same key that is used for rekeying operation during each… 

Figures and Tables from this paper

An Efficient Data Aggregation Technique for Green Communication in WSN
To have a protected WSN that is able to withstand malicious trust attacks, contribute an efficient data aggregation technique (EDAT) to enhance the packet delivery ratio in the network while reducing the time to segregate any malicious behavior focusing the trust in the entire network.


SADA: Secure approximate data aggregation in wireless sensor networks
Simulation results show that the SADA protocol incurs lower energy consumption and communication and computation cost compared to the state-of-the art protocols.
Secure Data Aggregation in Wireless Sensor Networks
The synopsis diffusion approach is made secure against attacks in which compromised nodes contribute false subaggregate values, and a novel lightweight verification algorithm by which the base station can determine if the computed aggregate includes any false contribution.
Secure Data Aggregation in Wireless Sensor Networks: Filtering out the Attacker's Impact
An attack-resilient computation algorithm is presented to enable the base station to securely compute predicate count or sum even in the presence of such an attack, and shows that this algorithm outperforms other existing approaches.
Attack-resilient hierarchical data aggregation in sensor networks
It is shown that even if a few compromised nodes contribute false sub-aggregate values, this results in large errors in the aggregate computed at the root of the hierarchy, which means that the approach is scalable and efficient.
SDAP: A Secure Hop-by-Hop Data Aggregation Protocol for Sensor Networks
Extensive analysis and simulations show that SDAP can achieve the level of efficiency close to an ordinary hop-by-hop aggregation protocol while providing high assurance on the trustworthiness of the aggregation result.
Secure outsourced aggregation via one-way chains
SECOA is presented, a framework with a family of novel and optimally-secure protocols for secure outsourced aggregation, based on a unified use of one-way chains that supports a large and diverse set of aggregate functions.
Exact In-Network Aggregation with Integrity and Confidentiality
This paper presents SIES, a scheme that solves exact SUM queries through a combination of homomorphic encryption and secret sharing, and shows how to adapt SIES in order to support many other exact aggregate queries (such as MAX, MEDIAN, etc.).
Efficient and Robust Schemes for Sensor Data Aggregation Based on Linear Counting
This study proposes two schemes based on the linear counting technique to deal with the overcounting problem in sensor networks, and demonstrates the efficiency and effectiveness of using these two schemes as solutions for processing aggregates in a sensor network.
Routing Protocol for Lifetime Maximization of Wireless Sensor Networks
Simulation results show a considerable performance improvement and energy saving leading to an overall improvement in network lifetime over classical directed diffusion.
Nodes Credit based Direct Diffusion for wireless sensor networks
How information can effectively be routed through the sensor network in order to prolong the lifetime of the sensor nodes and how efficient routing protocol is very critical.