As a result of confined computational power and vitality resources, aggregation of data from various sensor hubs done at the aggregating hub is regularly mastered by fundamental methodologies, for instance, averaging. However such total is known to be highly vulnerable to hub compromising assaults. Since WSN are, for the most part unattended and without modified safe gear, they are exceptionally helpless to such attacks. Consequently, finding unwavering quality of data and reputation of sensor hubs is crucial for WSN. As the execution of low power processors radically upgrades, future aggregator hubs will be fit for performing more modern data all out computations, subsequently making WSN less vulnerable. In this we demonstrate that few existing iterative isolating counts, while in a general sense more solid against connivance strikes than the direct averaging strategies, are by and by susceptive to a novel modern agreement assault we exhibit. To address this security issue, we propose a change for iterative separating procedures by giving a hidden theory to such counts which makes them agreement strong, and more exact and quicker combining.

Author Name: S.D.Manojna, Dr CH.Satyanarayana

URL: View PDF

Keywords: WSN, Robust Data Aggregation, Collusion Attacks

ISSN: ISSN : 0976-8491 (Online) | ISSN : 2229-4333 (Print)

EISSN:

EOI/DOI:

Add Citation Views: 1

---