A New Model to Analyzing of Node Compromise Attack in Range-free Localization Algorithms and New Criterion for Border Problem

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Banihashemian Seyed Saber; Adibnia Fazlollah; AGHA SARRAM MEHDI

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: ELECTRONIC INDUSTRIES Year:2019 | Volume:10 | Issue:1 Page(s): 45-60

Download Full-Text

Persian Verion

View:

386

Download:

Cites:

Information Journal Paper

Title

A New Model to Analyzing of Node Compromise Attack in Range-free Localization Algorithms and New Criterion for Border Problem

Author(s)

Banihashemian Seyed Saber | Adibnia Fazlollah | AGHA SARRAM MEHDI | Issue Writer Certificate

Keywords

LocalizationQ1

Wireless Sensor NetworksQ1

Range-freeQ1

Node compromise attackQ1

border problemQ1

Abstract

Different Range-free algorithms are proposed for location estimation in Wireless Sensor Networks. In these algorithms, the network is assumed to have no error and false data. This paper attempts to model an attack and evaluate and analysis the effect of malicious data produced by node compromised attacks in some of the Range-free algorithms: DV-hop, LSVM, NN and ELM. The false data may be produced by the malicious anchor nodes or compromised sensor nodes. The resistance of these algorithms against Node compromise attacks is compared. The results show that although DV-hop has less Localization error compared to the three other algorithms in a normal condition. However, LSVM and ELM, respectively, have less Localization error in the case of beacon node compromise and sensor Node compromise attacks. Further, in this research work, a new criterion is proposed for studying and comparing border problem issue in the Localization algorithms. Using the simulation results from various algorithms outcomes has been used for comparison, where it can be considered that LSVM has better performance in the border problem compared with the other studied algorithms.

Cites

No record.

References

No record.

Cite

APA: Copy

Banihashemian, Seyed Saber, Adibnia, Fazlollah, & AGHA SARRAM, MEHDI. (2019). A New Model to Analyzing of Node Compromise Attack in Range-free Localization Algorithms and New Criterion for Border Problem. ELECTRONIC INDUSTRIES, 10(1 ), 45-60. SID. https://sid.ir/paper/229677/en

Vancouver: Copy

Banihashemian Seyed Saber, Adibnia Fazlollah, AGHA SARRAM MEHDI. A New Model to Analyzing of Node Compromise Attack in Range-free Localization Algorithms and New Criterion for Border Problem. ELECTRONIC INDUSTRIES[Internet]. 2019;10(1 ):45-60. Available from: https://sid.ir/paper/229677/en

IEEE: Copy

Seyed Saber Banihashemian, Fazlollah Adibnia, and MEHDI AGHA SARRAM, “A New Model to Analyzing of Node Compromise Attack in Range-free Localization Algorithms and New Criterion for Border Problem,” ELECTRONIC INDUSTRIES, vol. 10, no. 1 , pp. 45–60, 2019, [Online]. Available: https://sid.ir/paper/229677/en

Related Journal Papers