Comparing reputation schemes for detecting malicious nodes in sensor networks

Partha Mukherjee, Sandip Sen

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

Remotely deployed sensor networks are vulnerable to both physical and electronic security breaches. The sensor nodes, once compromised, can send erroneous data to the base station, thereby possibly compromising network effectiveness. We assume that sensor nodes are organized in a hierarchy and use an offline neural network-based learning technique to predict the data sensed at any node given the data reported by its siblings in the hierarchy. This allows us to detect malicious nodes even when the siblings are not sensing data from the same distribution. The speed of detection of compromised nodes, however, critically depends on the mechanism used to update the reputation of the sensor nodes over time. We compare and contrast the relative strengths of a statistically grounded scheme and a reinforcement learning-based scheme both for their robustness to noise and responsiveness to change in sensor behavior. We first extend an existing mechanism to improve detection capability for smaller errors. Next we analyze the influence of different discount factors, including unweighted, exponential and linear discounts, on the tradeoff between responsiveness and robustness. We both develop a theoretical analysis to understand the tradeoff and perform experimental verification of our predictions by varying the patterns in sensed data.

Original languageEnglish (US)
Pages (from-to)482-489
Number of pages8
JournalComputer Journal
Volume54
Issue number3
DOIs
StatePublished - Mar 1 2011

Fingerprint

Sensor nodes
Sensor networks
Reinforcement learning
Base stations
Neural networks
Sensors

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

@article{d4bd80126a054a1fa9c3d2d85edcf3f6,
title = "Comparing reputation schemes for detecting malicious nodes in sensor networks",
abstract = "Remotely deployed sensor networks are vulnerable to both physical and electronic security breaches. The sensor nodes, once compromised, can send erroneous data to the base station, thereby possibly compromising network effectiveness. We assume that sensor nodes are organized in a hierarchy and use an offline neural network-based learning technique to predict the data sensed at any node given the data reported by its siblings in the hierarchy. This allows us to detect malicious nodes even when the siblings are not sensing data from the same distribution. The speed of detection of compromised nodes, however, critically depends on the mechanism used to update the reputation of the sensor nodes over time. We compare and contrast the relative strengths of a statistically grounded scheme and a reinforcement learning-based scheme both for their robustness to noise and responsiveness to change in sensor behavior. We first extend an existing mechanism to improve detection capability for smaller errors. Next we analyze the influence of different discount factors, including unweighted, exponential and linear discounts, on the tradeoff between responsiveness and robustness. We both develop a theoretical analysis to understand the tradeoff and perform experimental verification of our predictions by varying the patterns in sensed data.",
author = "Partha Mukherjee and Sandip Sen",
year = "2011",
month = "3",
day = "1",
doi = "10.1093/comjnl/bxq035",
language = "English (US)",
volume = "54",
pages = "482--489",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "3",

}

Comparing reputation schemes for detecting malicious nodes in sensor networks. / Mukherjee, Partha; Sen, Sandip.

In: Computer Journal, Vol. 54, No. 3, 01.03.2011, p. 482-489.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Comparing reputation schemes for detecting malicious nodes in sensor networks

AU - Mukherjee, Partha

AU - Sen, Sandip

PY - 2011/3/1

Y1 - 2011/3/1

N2 - Remotely deployed sensor networks are vulnerable to both physical and electronic security breaches. The sensor nodes, once compromised, can send erroneous data to the base station, thereby possibly compromising network effectiveness. We assume that sensor nodes are organized in a hierarchy and use an offline neural network-based learning technique to predict the data sensed at any node given the data reported by its siblings in the hierarchy. This allows us to detect malicious nodes even when the siblings are not sensing data from the same distribution. The speed of detection of compromised nodes, however, critically depends on the mechanism used to update the reputation of the sensor nodes over time. We compare and contrast the relative strengths of a statistically grounded scheme and a reinforcement learning-based scheme both for their robustness to noise and responsiveness to change in sensor behavior. We first extend an existing mechanism to improve detection capability for smaller errors. Next we analyze the influence of different discount factors, including unweighted, exponential and linear discounts, on the tradeoff between responsiveness and robustness. We both develop a theoretical analysis to understand the tradeoff and perform experimental verification of our predictions by varying the patterns in sensed data.

AB - Remotely deployed sensor networks are vulnerable to both physical and electronic security breaches. The sensor nodes, once compromised, can send erroneous data to the base station, thereby possibly compromising network effectiveness. We assume that sensor nodes are organized in a hierarchy and use an offline neural network-based learning technique to predict the data sensed at any node given the data reported by its siblings in the hierarchy. This allows us to detect malicious nodes even when the siblings are not sensing data from the same distribution. The speed of detection of compromised nodes, however, critically depends on the mechanism used to update the reputation of the sensor nodes over time. We compare and contrast the relative strengths of a statistically grounded scheme and a reinforcement learning-based scheme both for their robustness to noise and responsiveness to change in sensor behavior. We first extend an existing mechanism to improve detection capability for smaller errors. Next we analyze the influence of different discount factors, including unweighted, exponential and linear discounts, on the tradeoff between responsiveness and robustness. We both develop a theoretical analysis to understand the tradeoff and perform experimental verification of our predictions by varying the patterns in sensed data.

UR - http://www.scopus.com/inward/record.url?scp=79952149677&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79952149677&partnerID=8YFLogxK

U2 - 10.1093/comjnl/bxq035

DO - 10.1093/comjnl/bxq035

M3 - Article

AN - SCOPUS:79952149677

VL - 54

SP - 482

EP - 489

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 3

ER -