2007
DOI: 10.1109/tsmcc.2007.905824
|View full text |Cite
|
Sign up to set email alerts
|

On the Detection of Clones in Sensor Networks Using Random Key Predistribution

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
96
0

Year Published

2010
2010
2014
2014

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 129 publications
(96 citation statements)
references
References 15 publications
0
96
0
Order By: Relevance
“…Another centralized clone detection protocol has been recently proposed in (Brooks et al, 2007). This solution assumes that a random key pre distribution security scheme is implemented in the sensor network.…”
Section: Methodsmentioning
confidence: 99%
“…Another centralized clone detection protocol has been recently proposed in (Brooks et al, 2007). This solution assumes that a random key pre distribution security scheme is implemented in the sensor network.…”
Section: Methodsmentioning
confidence: 99%
“…It is easy for this method to fall into a single-point fault. Brooks et al [14] proposed an algorithm that would detect the node replication attacks by utilizing a statistical model based on the occurrence number of keys used to authenticate the nodes in wireless sensor networks, but the method can only be applied successfully with certain random key pre-distribution schemes. Choi et al [4] proposed a SET protocol in which the whole network is divided into exclusive subsets.…”
Section: Related Workmentioning
confidence: 99%
“…This is one of the early replica detection techniques which rely completely on the base station [1]. The main data structure this algorithm maintains is a key pool.…”
Section: Random Key Pre-distribution Techniquementioning
confidence: 99%