Interoperability of ad-hoc routing protocols

Loading...
Thumbnail Image
Authors
Raghuveer, Madhusudhan
Advisors
Pendse, Ravi
Issue Date
2008-05
Type
Thesis
Keywords
Research Projects
Organizational Units
Journal Issue
Citation
Abstract

Mobile ad-hoc networks are fast emerging and play a very important role in the field of wireless communications. With the advantages of mobility and infrastructure less the applications of ad-hoc networks have increased drastically. There are different routing protocols specifically designed for ad-hoc networks. Some examples of these routing protocols are DSDV, DSR AODV and DSR. Each of the routing protocols proposed for ad-hoc networks has its own advantages. For example DSDV is best suited for small scale ad-hoc networks and the design principles are very simple and are not very efficient when there is mobility and the size of the network increases. AODV and DSR are on-demand routing protocols and are best suited for large networks and also when a lot of mobility is involved among the wireless nodes in the network. Thus it is not possible to define a single routing protocol that would best suite all ad-hoc networks. The selection of a routing protocol purely depends on the application and also the scalability of the network. Having said that there cannot be a single routing protocol for all kinds of ad-hoc network this thesis concentrates on the concept of having interoperability between ad-hoc routing protocols. This thesis proposes a methodology which involves defining a universal packet which would be understood by all routing protocols. The design of having interoperability between the ad-hoc routing protocol involves three phases namely Bootstrap Phase, Route Discovery Phase and Data Exchange Phase. The method involved does not propose any changes to the existing protocols but an addition of universal packet format which would be understood by all routing protocols. Having discussed the proposed methodology for having interoperability between ad-hoc routing protocols this thesis discuses a mathematical model to calculate the maximum time involved in the Bootstrap Phase and the Route Discovery phase. The simulation results show that not only the number of hops to the egress node play important role in the time determination in Bootstrap Phase but also the distance between the source and the egress node play a key factor in the time determination process.

Table of Contents
Description
Thesis Thesis [M.S.] - Wichita State University, College of Engineering, Dept. of Electrical and Computer Engineering
Publisher
Wichita State University
Journal
Book Title
Series
PubMed ID
DOI
ISSN
EISSN