Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/512920
Title: Wormhole Isolation Method in MANET using Threshold Technique
Researcher: Vasudev, Rajiv
Guide(s): Sharma, Vikrant
Keywords: Computer Science
Computer Science Software Engineering
Engineering and Technology
University: GNA University
Completed Date: 2023
Abstract: In the ad-hoc networks, there are mobile nodes such as Personal Digital Assistance (PDA), smart phone and laptops; they have limited operational resources like battery power and bandwidth. The control traffic is to be minimized, which is the main responsibility of routing protocols by selecting the shortest path and controlling the traffic. In this study work, we focus on performance issues of routing protocols, Optimized Link State Routing (OLSR), Ad Hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Temporally Ordered Routing Algorithm (TORA) in mobility and standalone ad-hoc networks. For this purpose, we first study and explain these protocols and then we use the Optimized Network Engineering Tool (OPNET) modeler tool and analyze the performance metrics delay, throughput and network load. An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. We present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Each mobile host operates as a specialized router, and routes are obtained as needed (i.e., on-demand) with little or no reliance on periodic advertisements. Our new routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad-hoc networks. AODV provides loop-free routes even while repairing broken links. Because the protocol does not require global periodic routing advertisements, the demand on the overall bandwidth available to the mobile nodes is substantially less than in those protocols that do necessitate such advertisements. Nevertheless we can still maintain most of the advantages of basic distance vector routing mechanisms. We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm.
Pagination: i-x,1-213
URI: http://hdl.handle.net/10603/512920
Appears in Departments:Department of Computer Science

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File164.52 kBAdobe PDFView/Open
02_prelim pages.pdf2.13 MBAdobe PDFView/Open
03_content.pdf440.26 kBAdobe PDFView/Open
04_abstract.pdf145.47 kBAdobe PDFView/Open
05_chapter 1.pdf731.91 kBAdobe PDFView/Open
06_chapter 2.pdf311.61 kBAdobe PDFView/Open
07_chapter 3.pdf298.38 kBAdobe PDFView/Open
08_chapter 4.pdf380.9 kBAdobe PDFView/Open
09_chapter 5.pdf847.52 kBAdobe PDFView/Open
10_chapter 6.pdf48.47 kBAdobe PDFView/Open
11_annexures.pdf384.53 kBAdobe PDFView/Open
80_recommendation.pdf178.58 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: