A Secure Aggregation Protocol for Wireless Sensor Networks
Jaydip Sen

TL;DR
This paper introduces a secure, energy-efficient in-network aggregation protocol for wireless sensor networks that enhances fault tolerance and robustness against malicious nodes by broadcasting estimates rather than unicasting data.
Contribution
It proposes a novel secure aggregation algorithm that improves fault tolerance and energy efficiency in WSNs by using broadcast-based in-network computation.
Findings
The algorithm is energy-efficient and secure against malicious nodes.
Simulation results show improved fault tolerance and data availability.
The approach outperforms traditional snapshot aggregation methods.
Abstract
The purpose of a wireless sensor network (WSN) is to provide the users with access to the information of interest from data gathered by spatially distributed sensors. Generally the users require only certain aggregate functions of this distributed data. Computation of this aggregate data under the end-to-end information flow paradigm by communicating all the relevant data to a central collector node is a highly inefficient solution for this purpose. An alternative proposition is to perform in-network computation. This, however, raises questions such as: what is the optimal way to compute an aggregate function from a set of statistically correlated values stored in different nodes; what is the security of such aggregation as the results sent by a compromised or faulty node in the network can adversely affect the accuracy of the computed result. In this paper, we have presented an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
