2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks 2008
DOI: 10.1109/sahcn.2008.82
|View full text |Cite
|
Sign up to set email alerts
|

Mobile Sensor Network Resilient Against Node Replication Attacks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
57
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 54 publications
(58 citation statements)
references
References 7 publications
1
57
0
Order By: Relevance
“…All the nodes (normal and malicious) has equal radio range (r=10). In addition, the mobility model of [21] is employed for the nodes movement in the function area. In order to be sure of the results validity, each test is repeated 100 times and the final result is the average of these 100 tests.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…All the nodes (normal and malicious) has equal radio range (r=10). In addition, the mobility model of [21] is employed for the nodes movement in the function area. In order to be sure of the results validity, each test is repeated 100 times and the final result is the average of these 100 tests.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…BC-MEM achieves a higher detection probability than both LSM and B-MEM by using the cell forwarding technique [21]. HDA have more efficient detection probability than RM and LSM [22].A unique feature of XED is that each node is capable of detecting replicas per move which contrasts sharply with other protocols that need to mobilize the whole network for replica detection [27]. The probability of detecting replicated nodes in NBDS is much higher than RM, LSM protocols.…”
Section: Detection Of Replicated Nodesmentioning
confidence: 99%
“…The sensor node si meets another sensor node sj. If si never meets sj before, they exchange random numbers otherwise the sensor node si request the sensor node sj for the random number exchanged at earlier time, For the sensor node si, if the sensor node sj cannot replies or replies a number which does not match the number in si's memory, si announces the detection of a replica [27].…”
Section: Extremely Efficient Detection (Xed)mentioning
confidence: 99%
See 1 more Smart Citation
“…Furthermore, voting detection schemes lack the ability to detect clones if the number of replicas is large because of their collusion. A recent scheme [18] for clone attack detection in mobile environments proposed a solution in which each node records random numbers it has exchanged with the nodes which it encounters. If these two nodes contact again, they check the random number they have exchanged before.…”
Section: Related Workmentioning
confidence: 99%