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

A Systematic Methodology and Guidelines for Software Project Manager to Identify Key Stakeholders

Involving as many as possible of those who may be affected by or have an effect on any software project will lead to a better understanding, better process, greater community support as well as a more effective system...

One-to-Many Data Linkage By One-Class Clustering Tree

Data linkage is the task of identifying different entries that refer to the same entity across different data sources. The goal of the data linkage task is joining data sets that do not share a common identifier. Data...

Secure Authentication Schemes

There are different authentication methods to provide security. The most commonly used are textual passwords, but are commonly susceptible to brute -force attacks. Recognition and Recall-based techniques on graphical...

Closed Loop Micro strip Antenna Design For Wireless Technology

A small Dual band microstrip patch antenna is introduced. The advance of communication systems requires new antenna designs to comply with the ever-increasing demands of the wireless market. This presented antenna is...

Comparing Tesseract results with and without Character localization for Smartphone application

Tesseract is considered the most accurate free OCR engine in existence. Android operating system based Smartphones application where images taken from camera of mobile device or browsed from gallery are preprocessed....

Download PDF file
  • EP ID EP28315
  • DOI -
  • Views 336
  • 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