Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks

Mobile ad hoc networks (MANETs) are wireless networks that are subject to severe attacks, such as the black hole attack. One of the goals in the research is to find a method to prevent black hole attacks without decreasing network throughput or increasing routing overhead. The routing mechanism in...

Full description

Saved in:
Bibliographic Details
Main Author: Ghathwan, Khalil Ibrahim
Format: Thesis
Language:English
English
Published: 2016
Subjects:
Online Access:http://etd.uum.edu.my/5777/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.uum.etd.5777
record_format eprints
spelling my.uum.etd.57772021-04-05T02:21:26Z http://etd.uum.edu.my/5777/ Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks Ghathwan, Khalil Ibrahim QA Mathematics Mobile ad hoc networks (MANETs) are wireless networks that are subject to severe attacks, such as the black hole attack. One of the goals in the research is to find a method to prevent black hole attacks without decreasing network throughput or increasing routing overhead. The routing mechanism in define uses route requests (RREQs; for discovering routes) and route replies (RREPs; for receiving paths). However, this mechanism is vulnerable to attacks by malicious black hole nodes. The mechanism is developed to find the shortest secure path and to reduce overhead using the information that is available in the routing tables as an input to propose a more complex nature-inspired algorithm. The new method is called the Daddy Long-Legs Algorithm (PGO-DLLA), which modifies the standard AODV and optimizes the routing process. This method avoids dependency exclusively on the hop counts and destination sequence numbers (DSNs) that are exploited by malicious nodes in the standard AODV protocol. The experiment by performance metrics End-to-End delay and packet delivery ratio are compared in order to determine the best effort traffic. The results showed the PGO-DLLA improvement of the shortest and secure routing from black hole attack in MANET. In addition, the results indicate better performance than the related works algorithm with respect to all metrics excluding throughput which AntNet is best in routing when the pause time be more than 40 seconds. PGODLLA is able to improve the route discovery against the black hole attacks in AODV. Experiments in this thesis have shown that PGO-DLLA is able to reduce the normalized routing load, end-to-end delay, and packet loss and has a good throughput and packet delivery ratio when compared with the standard AODV protocol, BAODV protocol, and the current related protocols that enhance the routing security of the AODV protocols. 2016 Thesis NonPeerReviewed text en /5777/1/depositpermission_93453.pdf text en /5777/2/s93453_01.pdf Ghathwan, Khalil Ibrahim (2016) Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks. PhD. thesis, Universiti Utara Malaysia.
institution Universiti Utara Malaysia
building UUM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Utara Malaysia
content_source UUM Electronic Theses
url_provider http://etd.uum.edu.my/
language English
English
topic QA Mathematics
spellingShingle QA Mathematics
Ghathwan, Khalil Ibrahim
Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks
description Mobile ad hoc networks (MANETs) are wireless networks that are subject to severe attacks, such as the black hole attack. One of the goals in the research is to find a method to prevent black hole attacks without decreasing network throughput or increasing routing overhead. The routing mechanism in define uses route requests (RREQs; for discovering routes) and route replies (RREPs; for receiving paths). However, this mechanism is vulnerable to attacks by malicious black hole nodes. The mechanism is developed to find the shortest secure path and to reduce overhead using the information that is available in the routing tables as an input to propose a more complex nature-inspired algorithm. The new method is called the Daddy Long-Legs Algorithm (PGO-DLLA), which modifies the standard AODV and optimizes the routing process. This method avoids dependency exclusively on the hop counts and destination sequence numbers (DSNs) that are exploited by malicious nodes in the standard AODV protocol. The experiment by performance metrics End-to-End delay and packet delivery ratio are compared in order to determine the best effort traffic. The results showed the PGO-DLLA improvement of the shortest and secure routing from black hole attack in MANET. In addition, the results indicate better performance than the related works algorithm with respect to all metrics excluding throughput which AntNet is best in routing when the pause time be more than 40 seconds. PGODLLA is able to improve the route discovery against the black hole attacks in AODV. Experiments in this thesis have shown that PGO-DLLA is able to reduce the normalized routing load, end-to-end delay, and packet loss and has a good throughput and packet delivery ratio when compared with the standard AODV protocol, BAODV protocol, and the current related protocols that enhance the routing security of the AODV protocols.
format Thesis
author Ghathwan, Khalil Ibrahim
author_facet Ghathwan, Khalil Ibrahim
author_sort Ghathwan, Khalil Ibrahim
title Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks
title_short Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks
title_full Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks
title_fullStr Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks
title_full_unstemmed Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks
title_sort algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks
publishDate 2016
url http://etd.uum.edu.my/5777/
_version_ 1696978298836353024
score 13.160551