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 energy-efficient aggregation algorithm for WSNs that is secure and robust against malicious insider attack by any compromised or faulty node in the network. In contrast to the traditional snapshot aggregation approach in WSNs, a node in the proposed algorithm instead of unicasting its sensed information to its parent node, broadcasts its estimate to all its neighbors. This makes the system more fault-tolerant and increase the information availability in the network. The simulations conducted on the proposed algorithm have produced results that demonstrate its effectiveness.
[1]
John Turek,et al.
Challenges in Flexible Aggregation of Pervasive Data
,
2001
.
[2]
Chien-Chung Shen,et al.
Querying and tasking in sensor networks
,
2000,
Defense, Security, and Sensing.
[3]
Saurabh Ganeriwal,et al.
Aggregation in sensor networks: an energy-accuracy trade-off
,
2003,
Ad Hoc Networks.
[4]
Tomasz Imielinski,et al.
Prediction-based monitoring in sensor networks: taking lessons from MPEG
,
2001,
CCRV.
[5]
Deborah Estrin,et al.
Building efficient wireless sensor networks with low-level naming
,
2001,
SOSP.
[6]
David A. Wagner,et al.
Secure routing in wireless sensor networks: attacks and countermeasures
,
2003,
Ad Hoc Networks.
[7]
Deborah Estrin,et al.
Residual energy scan for monitoring sensor networks
,
2002,
2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).
[8]
Wei Hong,et al.
TinyDB: an acquisitional query processing system for sensor networks
,
2005,
TODS.
[9]
A Culminating Advance in the Theory and Practice of Data Fusion, Filtering, and Decentralized Estimation 1 Covariance Intersection Working Group (ciwg)
,
1997
.
[10]
Steven A. Borbash,et al.
Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks
,
2001,
MobiHoc '01.
[11]
Wei Hong,et al.
Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks
,
2022
.