A Survey: Secure Data Aggregation in Wireless Sensor Networks

Remote sensor systems (WSNs) are progressively utilized as a part of numerous applications, for example, spring of gushing lava and flame checking, urban detecting, and edge reconnaissance. In an extensive WSN, in-system information collection (i. e. , joining incomplete results at middle of the road hubs amid message directing) altogether decreases the measure of correspondence overhead and vitality utilization. The exploration group proposed a misfortune versatile collection structure called dissemination, which uses copy harsh calculations on top of multipath steering plans to precisely process totals (e. g. , predicate tally or entirety). Be that as it may, this collection system does not address the issue of false subtotal qualities contributed by bargained hubs. This assault may bring about vast mistakes in the total figured at the base station, which is the root hub in the collection chain of command. they make the summation dispersion methodology secure against the above assault propelled by traded off hubs. Specifically, they display a calculation to empower the base station to safely process predicate includes or whole evens the vicinity of such an assault. Total by sifting through the of bargained hubs in the aggregation hierarchy. In this paper, we present a survey of data aggregation algorithms in wireless sensor networks. We compare different algorithms on the basis of performance measures such as security, Communication overhead and data accuracy. We conclude with possible future research directions.