Date of Award

3-2008

Document Type

Thesis

Degree Name

Master of Science

Department

Department of Electrical and Computer Engineering

First Advisor

Scott A. Graham, PhD

Abstract

Mobile wireless network protocols currently run on optimistic routing algorithms, adjusting node connectivity only when the chosen connectivity metrics, such as signal strength, pass beyond minimum thresholds. Optimistic routing has several weaknesses. Optimistic routing suffers from increased network overhead during increased frequency of node movement and increased node density per area, and optimistic routing also suffers from non-optimistic access change for individual nodes. The overall communication throughput of a network may be increased if the network topology change is scripted; a scripted plan can allow messages to travel along a more efficient topological path while creating less topology control traffic. This would increase the overall network bandwidth and may be an alternative solution to current network routing problems such as route loop creation. This thesis tested a network with scripted movement against an unscripted network in a simple network featuring mobility, for increases in bandwidth due to scripted node access changes over optimistic access changes. The results showed significant improvement in the data throughput in the scripted network when there were multiple overlapping networks contending for the same node.

AFIT Designator

AFIT-GIR-ENG-08-03

DTIC Accession Number

ADA487114

Download

Share

COinS