PERFORMANCE ANALYSIS OF END-TO-END SMALL SEQUENCE NUMBERS ROUTING PROTOCOL

Open Access
Author:
Kim, Jangyoung
Graduate Program:
Computer Science and Engineering
Degree:
Master of Science
Document Type:
Master Thesis
Date of Defense:
June 16, 2010
Committee Members:
  • Kyusun Choi, Thesis Advisor
  • John Metzner, Thesis Advisor
Keywords:
  • routing protocol
  • sequence numbers
Abstract:
ABSTRACT In networking communication, there are several nodes and stations such as base station or destination nodes. For communication among each node, they send packets or data to each nodes and destination nodes. In this perspective, it is very important to determine the way or direction that packets or data are sent to each of the nodes or destination nodes. Thus the data or packet transmission efficiency is based on routing direction. One of the standard routing protocols is an ad-hoc routing protocol which determines the way the packets are sent to their destination. In an ad-hoc routing protocol, there are several kinds of protocols such as DSR (Dynamic Source Routing) and AODV (Ad-hoc On-demand Distance Vector). In the proposed protocol based on small end-to-end sequence numbers, route direction can be changed properly with the assistance of helper nodes. Between each station, there are helper nodes which guide the proper routes efficiently. In this thesis, we focus on the simulation analysis of the proposed protocol and comparison with other routing protocol models such as AODV (Ad-hoc On-demand Distance Vector) and DSR (Dynamic Source Routing). We simulated using parameters such as simulation time, number of nodes, number of connections and packet size. The performance criteria will be packet delivery fraction (reliability), routing load (routing overhead) and data throughput.