2008 the 28th International Conference on Distributed Computing Systems Workshops 2008
DOI: 10.1109/icdcs.workshops.2008.59
|View full text |Cite
|
Sign up to set email alerts
|

Compromised Sensor Nodes Detection: A Quantitative Approach

Abstract: In a wireless sensor network, an adversary may crack legal nodes or deploy malicious nodes to launch various attacks. These nodes are collectively called compromised nodes. In this paper, we define a Data Transmission Quality (DTQ) function to differentiate the legitimate nodes and compromised nodes. The DTQ function is defined in a way that it will keep close to constant or change smoothly for legitimate nodes and will keep decreasing for suspicious nodes. The final decision of whether or not a suspicious nod… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2009
2009
2013
2013

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 22 publications
(15 citation statements)
references
References 9 publications
0
14
0
Order By: Relevance
“…This is a common assumption, and it represents an active area of research (for instance see [14,15]). Last, we assume that there is a way to distribute key updates secretly and on an authenticated channel, and there is a way to distribute authenticated messages commanding nodes to update their counters.…”
Section: Scheme Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…This is a common assumption, and it represents an active area of research (for instance see [14,15]). Last, we assume that there is a way to distribute key updates secretly and on an authenticated channel, and there is a way to distribute authenticated messages commanding nodes to update their counters.…”
Section: Scheme Analysismentioning
confidence: 99%
“…We assume that a compromised node is eventually detected: different detection strategies exist in literature [14,15]. If a node is compromised, the ACM increments c 1 and c 2 , and transfers to all non-compromised sensors, on a secure channel, the updated value S = h(S, c 1 ): this step can be performed through a secure broadcast scheme 4 .…”
Section: Putting It All Togethermentioning
confidence: 99%
“…However, this approach is only effective for static networks. In [10], the authors propose a localized approach to detect compromised nodes. All the sensor nodes are divided into multiple groups.…”
Section: Related Workmentioning
confidence: 99%
“…Michiardi and Molva assign a value to the "reputation" of a node and use this information to identify misbehaving nodes and cooperate only with nodes with trusted reputations [6]. Albers and Camp couple a trust-based mechanism with a mobile agent based intrusion detection system, but do not discuss the security implications or overhead needed to secure the network and individual nodes from the mobile agents themselves [7].Gateway nodes in neighboring zones can then further collaborate to perform intrusion detection tasks in a wider area and to attempt to reduce false positive alarms [8].…”
Section: Related Workmentioning
confidence: 99%