Selfish Node Detection Based on GA and Learning Automata in IoT

Publish Year: 1401
نوع سند: مقاله ژورنالی
زبان: English
View: 208

This Paper With 15 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

این Paper در بخشهای موضوعی زیر دسته بندی شده است:

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

JR_ITRC-15-1_001

تاریخ نمایه سازی: 10 اردیبهشت 1402

Abstract:

It is critical to increasing the network throughput on the internet of things with short-range nodes. Nodes prevent to cooperate with other nodes are known as selfish nodes. The proposed method for discovering the selfish node is based on genetic algorithm and learning automata. It consists of three phases of setup and clustering, the best routing selection based on genetic algorithm, and finally, the learning and update phase. The clustering algorithm implemented in the first phase. In the second phase, the neighbor node selected for forwarding the packet in which has a high value of fitness function. In the third phase, each node monitors its neighbor nodes and uses the learning automata system to identify the selfish nodes. The results of the simulation has shown the detection accuracy of selfish nodes in comparison with the existing methods average ۱۰ %, and the false positive rate has decreased by ۵ %.

Keywords:

Internet of Thing (IoT) , selfish node , Genetic Algorithm (GA) , Learning Automata (LA) , Detection accuracy (DA) , false positive rate (FPR).

Authors

Solmaz Nopahari

Computer engineering department, Science and Research Branch, Islamic Azad University Tehran, Iran

Hossein Gharaee

Iran Telecommunication Research Center (ITRC) Tehran, Iran

Ahmad Khademzadeh

Iran Telecommunication Research Center (ITRC) Tehran, Iran