Twenty-Third Annual Computer Security Applications Conference (ACSAC 2007) 2007
DOI: 10.1109/acsac.2007.26
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Distributed Detection of Node Replication Attacks in Sensor Networks

Abstract: Wireless sensor nodes lack hardware support for tamperresistance and are often deployed in unattended environments, thus leaving them vulnerable to capture and compromise by an adversary. In a node replication attack, an adversary uses the credentials of a compromised node to surreptitiously introduce replicas of that node into the network. These replicas are then used to launch a variety of attacks that subvert the goal of the sensor application, and the operation of the underlying protocols. We present a nov… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
94
0
3

Year Published

2009
2009
2022
2022

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 102 publications
(97 citation statements)
references
References 11 publications
0
94
0
3
Order By: Relevance
“…The LSM algorithm behavior is similar to that of RM, but exploits the routing topology and uses geometric probabilities to detect replicated nodes, to reduce the communication costs and improve detection probability. Conti, Zhu et al [4][5] presented two other improvements. But all these schemes are based on location information and have some defects.…”
Section: Related Workmentioning
confidence: 95%
“…The LSM algorithm behavior is similar to that of RM, but exploits the routing topology and uses geometric probabilities to detect replicated nodes, to reduce the communication costs and improve detection probability. Conti, Zhu et al [4][5] presented two other improvements. But all these schemes are based on location information and have some defects.…”
Section: Related Workmentioning
confidence: 95%
“…The RED [10] protocol has higher flexibility of distinguishing imitated hubs when contrasted with LSM and has higher copies location rate than RM, DM and LSM protocols, be that as it may it has high correspondence overheads. In SDC [16] witness hubs are picked arbitrarily from the hubs of a given set rather than the entire system as in the RM protocol. It additionally gives higher strength against hub replication assault and it likewise has great rate of recognizing imitations.…”
Section: Comparison Of Node Replication Attacks In Static Wsnsmentioning
confidence: 99%
“…It additionally gives higher strength against hub replication assault and it likewise has great rate of recognizing imitations. P-MPC [16] protocol works same as SDC, yet is more memory effective than SDC and furthermore has better rate of distinguishing duplicated hubs in WSNs. RAWL [12] appropriates obligation of choosing witness hub to each go-between hub go in irregular walk, so for a foe it turns out to be very hard to discover witness hubs.…”
Section: Comparison Of Node Replication Attacks In Static Wsnsmentioning
confidence: 99%
“…The advantage is less communication cost, high detection rate and less storage requirements. Zhu et al (2007), two more schemes are proposed which are Single Deterministic Cell and Parallel Multiple Probabilistic Cells. In the first scheme, each node ID is associated with a single cell.…”
Section: Related Workmentioning
confidence: 99%