The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).
If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.
Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.
BibTex Citation Data :
@article{JOIV254,
author = {Mehdi Safari and Elham Bahmani and Mojtaba Jamshidi and Abdusalam Shaltooki},
title = {Advanced Extremely Efficient Detection of Replica Nodes in Mobile Wireless Sensor Networks},
journal = {JOIV : International Journal on Informatics Visualization},
volume = {3},
number = {4},
year = {2019},
keywords = {wireless sensor network; mobile nodes; security; replication attack, XED algorithm.},
abstract = {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.},
issn = {2549-9904}, pages = {337--342}, doi = {10.30630/joiv.3.4.254},
url = {http://joiv.org/index.php/joiv/article/view/254}
}
Refworks Citation Data :
@article{{JOIV}{254}, author = {Safari, M., Bahmani, E., Jamshidi, M., Shaltooki, A.}, title = {Advanced Extremely Efficient Detection of Replica Nodes in Mobile Wireless Sensor Networks}, journal = {JOIV : International Journal on Informatics Visualization}, volume = {3}, number = {4}, year = {2019}, doi = {10.30630/joiv.3.4.254}, url = {} }Refbacks
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
__________________________________________________________________________
JOIV : International Journal on Informatics Visualization
ISSN 2549-9610 (print) | 2549-9904 (online)
Organized by Department of Information Technology - Politeknik Negeri Padang, and Institute of Visual Informatics - UKM and Soft Computing and Data Mining Centre - UTHM
Published by Department of Information Technology - Politeknik Negeri Padang
W : http://joiv.org
E : joiv@pnp.ac.id, hidra@pnp.ac.id, rahmat@pnp.ac.id
View JOIV Stats
is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.