Boyeon Jang

Date of Award

3-2008

Document Type

Thesis

Degree Name

Master of Science in Computer Science

Department

Department of Electrical and Computer Engineering

First Advisor

Scott A. Graham, PhD

Abstract

Mobile Ad Hoc Network (MANET) routing protocols provide routing solutions in mobile wireless networks, without assuming any prior knowledge of topology nor any prediction of future topology. However, the resulting routes suffer from delay and consume precious bandwidth. Perfectly scripted routing could theoretically be optimal, (i.e., introduce no delay and cost no additional bandwidth), but would naturally be very fragile. This thesis explores a merging of these approaches, following a routing script if and when available, but reverting to a robust recovery approach otherwise. Script-Assisted Ad Hoc On-demand Distance Vector (S-AODV) routing protocol is designed to take advantage of prior knowledge of topology to improve performance in a MANET, better utilizing available bandwidth. S-AODV uses pre-simulation to build a script to substitute for the route discovery process, avoiding delay and bandwidth penalties. Before sending any Route Request Packets (RREQs) to find a route, S-AODV consults the script. If the data exists, it updates the routing table. If not then it broadcasts RREQs like AODV routing protocol. Using this approach, S-AODV enjoys reduced routing traffic and route discovery times. S-AODV is compared with Ad Hoc On-demand Distance Vector (AODV) routing protocol. S-AODV provides better performance in reducing routing traffic, route discovery time, and end-to-end delay. Also, S-AODV has better throughput in most scenarios except the environment in fast movement or heavy traffic loads.

AFIT Designator

AFIT-GCS-ENG-08-13

DTIC Accession Number

ADA487123

Download

Share

COinS