Computing Data Aggregation with Secure in Wireless Sensor Networks

Abstract

Wireless sensor networks (WSNs) are constrained in terms of memory, computation, communication, and energy. To reduce communication overhead and energy expenditure in (WSNs), data aggregation is used. Data aggregation is a very important technique, but it gives extra opportunity to the adversary to attack the network, inject false messages into the network and trick the base station to accept false aggregation results.. Lately, the research neighborhood has proposed a amazing aggregation framework referred to as synopsis diffusion which combines multi path routing schemes with duplicate-insensitive algorithms to safely compute aggregates (e.g., predicate count, Sum) in spite of message losses as a consequence of node and transmission screw ups. Nevertheless, this aggregation framework does not advert-gown the concern of false sub-aggregate values contributed by com-promised nodes leading to tremendous blunders within the combination computed at the base station, which is the foundation node within the aggregation hierarchy. That is an most important obstacle on the grounds that sensor networks are tremendously prone to node compromises due to the unattended nature of sensor nodes and the shortage of tamper-resistant hardware.