Abstract

Secure in-network aggregation in wireless sensor networks is a necessary and challenging task. In this paper, based on an extended Kalman filter which can facilitate us to set up a normal range of the neighbor's future transmitted aggregated values, we further apply an algorithm of combining cumulative summation and generalized likelihood ratio, which can utilize the cumulative sum of the deviations between measured values and estimated values, and derive a normal range which is more sensitive to attacks. We conduct experiments and simulations to evaluate our proposed local detection mechanisms under different aggregation functions.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.