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.
How to cite (IEEE):
E. Bahmani, S. Dashtevan, A. Shaltooki, & M. Jamshidi
"Using One-hop and Two-hop Neighbouring Information to Defend Against Sybil Attacks in Stationary Wireless Sensor Network," JOIV : International Journal on Informatics Visualization, vol. 3, no. 2, , pp. 143 - 150, May. 2019.
https://doi.org/10.30630/joiv.3.2.235
How to cite (APA):
Bahmani, E., Dashtevan, S., Shaltooki, A., & Jamshidi, M.
(2019).
Using One-hop and Two-hop Neighbouring Information to Defend Against Sybil Attacks in Stationary Wireless Sensor Network.
JOIV : International Journal on Informatics Visualization, 3(2), 143 - 150.
https://doi.org/10.30630/joiv.3.2.235
How to cite (Chicago):
Bahmani, Elham, Dashtevan, Sheida, Shaltooki, Abdusalam, AND Jamshidi, Mojtaba.
"Using One-hop and Two-hop Neighbouring Information to Defend Against Sybil Attacks in Stationary Wireless Sensor Network" JOIV : International Journal on Informatics Visualization [Online], Volume 3 Number 2 (11 May 2019)
https://doi.org/10.30630/joiv.3.2.235
How to cite (Vancouver):
Bahmani E, Dashtevan S, Shaltooki A, & Jamshidi M .
Using One-hop and Two-hop Neighbouring Information to Defend Against Sybil Attacks in Stationary Wireless Sensor Network.
JOIV : International Journal on Informatics Visualization [Online]. 2019 May;
3(2):143 - 150.
https://doi.org/10.30630/joiv.3.2.235
How to cite (Harvard):
Bahmani, E., Dashtevan, S., Shaltooki, A., & Jamshidi, M.
,2019.
Using One-hop and Two-hop Neighbouring Information to Defend Against Sybil Attacks in Stationary Wireless Sensor Network.
JOIV : International Journal on Informatics Visualization, [Online] 3(2), pp. 143 - 150.
https://doi.org/10.30630/joiv.3.2.235
How to cite (MLA8):
Bahmani, Elham, Sheida Dashtevan, Abdusalam Shaltooki, & Mojtaba Jamshidi.
"Using One-hop and Two-hop Neighbouring Information to Defend Against Sybil Attacks in Stationary Wireless Sensor Network." JOIV : International Journal on Informatics Visualization [Online], 3.2 (2019): 143 - 150. Web. 25 Sep. 2023
, https://doi.org/10.30630/joiv.3.2.235
BibTex Citation Data :
@article{JOIV235,
author = {Elham Bahmani and Sheida Dashtevan and Abdusalam Shaltooki and Mojtaba Jamshidi},
title = {Using One-hop and Two-hop Neighbouring Information to Defend Against Sybil Attacks in Stationary Wireless Sensor Network},
journal = {JOIV : International Journal on Informatics Visualization},
volume = {3},
number = {2},
year = {2019},
keywords = {Wireless Sensor Network; Security; Sybil attack;},
abstract = {Considering the application of wireless sensor networks (WSNs) in critical areas like war fields, establishing security in these networks is of great challenge. One of the important and dangerous attacks in these networks is the Sybil attack. In this attack, a malicious node broadcasts several IDs simultaneously. Thus, the malicious node of the adversary attracts high traffic to itself and disrupts routing protocols and affects other operations of the network like data aggregation, voting, and resource allocation, negatively. In this paper, an efficient algorithm based on one-hop and two-hop neighborhood information is proposed to detect Sybil nodes in the stationary WSNs. The proposed algorithm is executed locally with the collaboration of neighboring nodes. The main purpose of the proposed algorithm is to increase the accuracy of detecting Sybil nodes under various conditions including the condition in which a malicious node broadcasts a few numbers of Sybil IDs which is the shortcoming of most existing algorithms. The proposed algorithm is simulated in MATLAB and its efficiency is compared with two similar algorithms in terms of true and false detection rates. The proposed algorithm not only reduces communication overhead but also increases the accuracy of detecting Sybil nodes compared to two similar algorithms.},
issn = {2549-9904}, pages = {143--150}, doi = {10.30630/joiv.3.2.235},
url = {https://joiv.org/index.php/joiv/article/view/235}
}
Refworks Citation Data :
@article{{JOIV}{235}, author = {Bahmani, E., Dashtevan, S., Shaltooki, A., Jamshidi, M.}, title = {Using One-hop and Two-hop Neighbouring Information to Defend Against Sybil Attacks in Stationary Wireless Sensor Network}, journal = {JOIV : International Journal on Informatics Visualization}, volume = {3}, number = {2}, year = {2019}, doi = {10.30630/joiv.3.2.235}, 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
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.