Location-Based Approach for Route Maintenance in Dynamic Source Routing Protocol

Earlier, the idea of mobile computers and ad hoc networks was not on the mind of anyone. All speci¯cations and implementations for the computer networks during that time were designed for wired systems. This is a big challenge for computer engineer since these two systems have di®erent characteri...

Full description

Saved in:
Bibliographic Details
Main Author: Sjaugi, Muhammad Farhan
Format: Thesis
Language:English
English
Published: 2008
Subjects:
Online Access:http://psasir.upm.edu.my/id/eprint/5234/1/FSKTM_2008_9.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-upm-ir.5234
record_format uketd_dc
institution Universiti Putra Malaysia
collection PSAS Institutional Repository
language English
English
topic Wireless Application Protocol (Computer network protocol).
Routing protocols (Computer network protocols).

spellingShingle Wireless Application Protocol (Computer network protocol).
Routing protocols (Computer network protocols).

Sjaugi, Muhammad Farhan
Location-Based Approach for Route Maintenance in Dynamic Source Routing Protocol
description Earlier, the idea of mobile computers and ad hoc networks was not on the mind of anyone. All speci¯cations and implementations for the computer networks during that time were designed for wired systems. This is a big challenge for computer engineer since these two systems have di®erent characteristics. Wireless network means dynamic topology, dynamic structure and no infrastructure, while wired network is the opposites. Basically mobile wireless network has the same stan- dard layers of structure, with modi¯cations and functionality that di®er from the earlier networks because of the absence of infrastructure. To facilitate communication within the network, a routing protocol is used to dis- cover routes between nodes. Building a MANET routing protocol is not an easy job, since e±ciency and correctness become the main concern. Some approach had been proposed to make routing protocol becomes e±cient and correct. Dynamic Source Routing (DSR) protocol is known to be a simple routing protocol in MANET. DSR is based on the concept of source routing. For this protocol, mobile nodes are required to maintain route caches that contain the source routes of which the mobile is aware. Entries in the route cache are continually updated as new routes are learned. There are two major phases of the protocol - route discovery and route maintenance Route discovery uses route request and route reply packets. Route maintenance uses route error packets and acknowledgments. Although DSR can respond a route quickly, it yields a long delay when a route is rebuilt. This is because when source node receives RERR packet, it will try to ¯nd alternative routes from route cache. If alternative routes are not available, source node, then, will enter route discovery phase to ¯nd new routes. Finding a route in wireless network require considerable resources, such as time, bandwidth, and power because it relies on broadcasting. In some case any packets may still reach its destination, but with some delay. This delay is very expensive and leads to undesired e®ect, especially in real time networks and the networks with QoS, where the packet delay and packet delivery is the main concern. The objectives of this research are to propose new algorithm to detect route failure as early warning message to the protocol to take further action, and to propose new algorithm for DSR route maintenance to response the early warning message from route failure detection algorithm. The proposed algorithms based on node location information that may be collected through Global Positioning System (GPS). This thesis introduces two new route maintenance strategies by utilizing node location information. These new route maintenance strategies are called as DIS- TANCE (DIstance baSed rouTe maintenANCE) and ADISTANCE (Adaptive DISTANCE). The algorithms work by adding another node (called bridge node) into the source list to prevent the link from failure. From the simulation result, both algoritmns improves the performance of DSR in terms of packet sending ratio, delay and routing overhead.This thesis introduces two new route maintenance strategies by utilizing node location information. These new route maintenance strategies are called as DIS- TANCE (DIstance baSed rouTe maintenANCE) and ADISTANCE (Adaptive DISTANCE). The algorithms work by adding another node (called bridge node) into the source list to prevent the link from failure. From the simulation result, both algoritmns improves the performance of DSR in terms of packet sending ratio, delay and routing overhead.
format Thesis
qualification_level Master's degree
author Sjaugi, Muhammad Farhan
author_facet Sjaugi, Muhammad Farhan
author_sort Sjaugi, Muhammad Farhan
title Location-Based Approach for Route Maintenance in Dynamic Source Routing Protocol
title_short Location-Based Approach for Route Maintenance in Dynamic Source Routing Protocol
title_full Location-Based Approach for Route Maintenance in Dynamic Source Routing Protocol
title_fullStr Location-Based Approach for Route Maintenance in Dynamic Source Routing Protocol
title_full_unstemmed Location-Based Approach for Route Maintenance in Dynamic Source Routing Protocol
title_sort location-based approach for route maintenance in dynamic source routing protocol
granting_institution Universiti Putra Malaysia
granting_department Computer Science and Information Technology
publishDate 2008
url http://psasir.upm.edu.my/id/eprint/5234/1/FSKTM_2008_9.pdf
_version_ 1747810379994497024
spelling my-upm-ir.52342013-05-27T07:21:21Z Location-Based Approach for Route Maintenance in Dynamic Source Routing Protocol 2008 Sjaugi, Muhammad Farhan Earlier, the idea of mobile computers and ad hoc networks was not on the mind of anyone. All speci¯cations and implementations for the computer networks during that time were designed for wired systems. This is a big challenge for computer engineer since these two systems have di®erent characteristics. Wireless network means dynamic topology, dynamic structure and no infrastructure, while wired network is the opposites. Basically mobile wireless network has the same stan- dard layers of structure, with modi¯cations and functionality that di®er from the earlier networks because of the absence of infrastructure. To facilitate communication within the network, a routing protocol is used to dis- cover routes between nodes. Building a MANET routing protocol is not an easy job, since e±ciency and correctness become the main concern. Some approach had been proposed to make routing protocol becomes e±cient and correct. Dynamic Source Routing (DSR) protocol is known to be a simple routing protocol in MANET. DSR is based on the concept of source routing. For this protocol, mobile nodes are required to maintain route caches that contain the source routes of which the mobile is aware. Entries in the route cache are continually updated as new routes are learned. There are two major phases of the protocol - route discovery and route maintenance Route discovery uses route request and route reply packets. Route maintenance uses route error packets and acknowledgments. Although DSR can respond a route quickly, it yields a long delay when a route is rebuilt. This is because when source node receives RERR packet, it will try to ¯nd alternative routes from route cache. If alternative routes are not available, source node, then, will enter route discovery phase to ¯nd new routes. Finding a route in wireless network require considerable resources, such as time, bandwidth, and power because it relies on broadcasting. In some case any packets may still reach its destination, but with some delay. This delay is very expensive and leads to undesired e®ect, especially in real time networks and the networks with QoS, where the packet delay and packet delivery is the main concern. The objectives of this research are to propose new algorithm to detect route failure as early warning message to the protocol to take further action, and to propose new algorithm for DSR route maintenance to response the early warning message from route failure detection algorithm. The proposed algorithms based on node location information that may be collected through Global Positioning System (GPS). This thesis introduces two new route maintenance strategies by utilizing node location information. These new route maintenance strategies are called as DIS- TANCE (DIstance baSed rouTe maintenANCE) and ADISTANCE (Adaptive DISTANCE). The algorithms work by adding another node (called bridge node) into the source list to prevent the link from failure. From the simulation result, both algoritmns improves the performance of DSR in terms of packet sending ratio, delay and routing overhead.This thesis introduces two new route maintenance strategies by utilizing node location information. These new route maintenance strategies are called as DIS- TANCE (DIstance baSed rouTe maintenANCE) and ADISTANCE (Adaptive DISTANCE). The algorithms work by adding another node (called bridge node) into the source list to prevent the link from failure. From the simulation result, both algoritmns improves the performance of DSR in terms of packet sending ratio, delay and routing overhead. Wireless Application Protocol (Computer network protocol). Routing protocols (Computer network protocols). 2008 Thesis http://psasir.upm.edu.my/id/eprint/5234/ http://psasir.upm.edu.my/id/eprint/5234/1/FSKTM_2008_9.pdf application/pdf en public masters Universiti Putra Malaysia Wireless Application Protocol (Computer network protocol). Routing protocols (Computer network protocols). Computer Science and Information Technology English