Advanced Extremely Efficient Detection of Replica Nodes in Mobile Wireless Sensor Networks

Today, wireless sensor networks (WSNs) are widely used in many applications including the environment, military, and explorations. One of the most dangerous attacks against these networks is node replication. In this attack, the adversary captures a legal node of the network, generates several copie...

Full description

Saved in:
Bibliographic Details
Main Authors: Safari, Mehdi (Author), Bahmani, Elham (Author), Jamshidi, Mojtaba (Author), Shaltooki, Abdusalam (Author)
Format: EJournal Article
Published: Politeknik Negeri Padang, 2019-09-16.
Subjects:
Online Access:Get Fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 02706 am a22003013u 4500
001 IJOIV_254_232
042 |a dc 
100 1 0 |a Safari, Mehdi  |e author 
100 1 0 |e contributor 
700 1 0 |a Bahmani, Elham  |e author 
700 1 0 |a Jamshidi, Mojtaba  |e author 
700 1 0 |a Shaltooki, Abdusalam  |e author 
245 0 0 |a Advanced Extremely Efficient Detection of Replica Nodes in Mobile Wireless Sensor Networks 
260 |b Politeknik Negeri Padang,   |c 2019-09-16. 
500 |a https://joiv.org/index.php/joiv/article/view/254 
520 |a Today, wireless sensor networks (WSNs) are widely used in many applications including the environment, military, and explorations. One of the most dangerous attacks against these networks is node replication. In this attack, the adversary captures a legal node of the network, generates several copies of the node (called, replica nodes) and injects them in the network. Various algorithms have been proposed to handle replica nodes in stationary and mobile WSNs. One of the most well-known algorithms to handle this attack in mobile WSNs is eXtremely Efficient Detection (XED). The main idea of XED is to generate and exchange random numbers among neighboring nodes. The XED has some drawbacks including high communication and memory overheads and low speed in the detection of replica nodes. In this paper, an algorithm is presented to improve XED. The proposed algorithm is called Advanced XED (AXED) in which each node observes a few numbers of nodes and whenever two nodes meet, a new random number is generated and exchanged. The efficiency of the proposed algorithm is evaluated in terms of the memory and communication overheads and its results are compared with existing algorithms. The comparison results show that the proposed algorithm imposes lower overheads to the nodes. In addition, the proposed algorithm is simulated and the simulation results show that the proposed algorithm is able to detect replica nodes faster than XED. 
540 |a Copyright (c) 2019 Mehdi Safari, Elham Bahmani, Mojtaba Jamshidi, Abdusalam Shaltooki 
540 |a http://creativecommons.org/licenses/by-sa/4.0 
546 |a eng 
690 |a wireless sensor network; mobile nodes; security; replication attack, XED algorithm. 
655 7 |a info:eu-repo/semantics/article  |2 local 
655 7 |a info:eu-repo/semantics/publishedVersion  |2 local 
655 7 |a Peer-reviewed Article  |2 local 
786 0 |n JOIV : International Journal on Informatics Visualization; Vol 3, No 4 (2019); 337 - 342 
786 0 |n 2549-9904 
786 0 |n 2549-9610 
787 0 |n https://joiv.org/index.php/joiv/article/view/254/232 
856 4 1 |u https://joiv.org/index.php/joiv/article/view/254/232  |z Get Fulltext