An Attack-Resilient Computation Algorithm To Compute Successful Aggregates In The Presence Of Attacks

Abstract

In-network data aggregation can decrease the amount of communication and hence the energy consumed especially in large WSNs. The main idea is to unite partial results at intermediate nodes during message routing. One approach is to build a spanning tree rooted at the BS and then perform in-network aggregation along the tree. The important aggregates considered by the research community include Count and Sum. It is simple to simplify these aggregates to predicate Count and Sum. We can also simply expand a Sum algorithm to compute Standard Deviation and Statistical Moment of any order. The possibility of node compromise introduces more challenges because most of the existing in-network aggregation algorithms have no provisions for security. A compromised node might effort to prevent the aggregation process by launching several attacks such as eavesdropping, jamming, message dropping, message fabrication and so on. This paper focuses on a subclass of these attacks in which the adversary aims to cause the BS to derive an incorrect aggregate.

Authors and Affiliations

P. Raj Priyanka, B. Lakshmana Rao

Keywords

Related Articles

Image Depth Approximation using Bezier-Bernstein polynomial for 3D cameras

passive depth estimation techniques with improved precision can replace active methods in 3D cameras. In this paper, we introduce accurate depth estimation from image focus using cubic degree Bezier-Bernstein polynomi...

Vertical And Horizontal Partition Of Microdata For Publishing Through Privacy

Several anonymization techniques, such as generalization and bucketization, have been designed for privacy preserving micro data publishing. Recent work has shown that generalization loses considerable amount of info...

Cloud Removal from Satellite using Cloning Method

Cloud removal approach based on information cloning is introduced. In this methodology it evacuates all cloud sullied segments of a satellite picture and it is then recreates the data which contains taking so as to miss...

Inter Transactional Association Rule Mining using Boolean Matrix

One of the extensions of the data mining is Temporal data mining, which mines or discovers knowledge and patterns from temporal information which includes time attribute analysis. From the various types of temporal...

Text Clustering Using Cosine Similarity and Matrix Factorization

Clustering is a useful technique that organizes a large quantity of unordered text documents into a small number of meaningful and coherent clusters, thereby providing a basis for intuitive and informative navigation...

Download PDF file
  • EP ID EP28315
  • DOI -
  • Views 310
  • Downloads 6

How To Cite

P. Raj Priyanka, B. Lakshmana Rao (2015). An Attack-Resilient Computation Algorithm To Compute Successful Aggregates In The Presence Of Attacks. International Journal of Research in Computer and Communication Technology, 4(11), -. https://europub.co.uk/articles/-A-28315