Evaluating the performance of the novel neighbor weight-based trust determination algorithm in wireless ad hoc networks

مقدم أطروحة جامعية

Abu Rumman, Ali Abd al-Latif Abd Allah

مشرف أطروحة جامعية

al-Bahadili, Husayn
Hattab, Izz al-Din Shakir Hasan

أعضاء اللجنة

Salamah, Walid
Ahmad, Ashraf M. A.

الجامعة

جامعة الأميرة سمية للتكنولوجيا

الكلية

كلية الملك الحسين لعلوم الحوسبة

القسم الأكاديمي

قسم علم الحاسوب

دولة الجامعة

الأردن

الدرجة العلمية

ماجستير

تاريخ الدرجة العلمية

2013

الملخص الإنجليزي

Wireless ad hoc networks are susceptible to attacks by malicious nodes that could easily bring down the whole network.

Therefore, it is important to have a reliable mechanism for detecting and isolating malicious nodes before they can do any harm to the network.

Trust-based routing protocols are one possible mechanism as they locate trusted routes dynamically to conform to network environment.

However, such algorithms require reliable and effective trust determination algorithm.

The novel Neighbor Weight-based Trust Determination (NWTD) algorithm is one algorithm in this direction.

It has been proposed to detect and isolate malicious nodes and make the routing process in wireless ad hoc environment more secure.

It can be implemented by any node to determine the trust of its first and second hop neighbors, and propagate the computed trust to other nodes in the network.

Then, the node considers any node in its routing table as malicious node if its trust goes below a certain minimum acceptable trust (MAT), and consequently eliminates it from its routing table.

However, the algorithm have not been implemented or evaluated in any realistic or simulated environment. The thesis develops and presents a detail description of an efficient and flexible implementation of the NWTD algorithm on the Mobile Ad hoc Network (MANET) simulator (MANSim), and then uses the simulator to evaluate the performance of the algorithm in various network configuration and operation environments.

In particular, four scenarios of similar network configuration but different node behaviors are simulated.

The results demonstrated the effectiveness and reliability of the algorithm in isolating any maliciously behaving node(s).

The time desired by any node to isolate any maliciously behaving node(s) in the network (convergence time) depends on the number and trust of its first and second hop neighbors, number of nodes identifying this malicious behavior, punishment factor, and MAT.

By a careful and professional adjustment to the above parameters, a network operator/manager can reduce the convergence time to the minimum acceptable level to ensure stable and secure network operation.

التخصصات الرئيسية

هندسة الاتصالات

الموضوعات

• الشبكات اللاسلكية المخصصة
• الإذاعة

عدد الصفحات

92

قائمة المحتويات

• APA
• MLA
• AMA

لغة النص

الإنجليزية

نوع البيانات

رسائل جامعية

رقم السجل

BIM-413839