Summary
A wireless ad-hoc network is a collection of specific infrastructureless mobile nodes forming a temporary network without any centralized administration. A user can move anytime in an ad-hoc scenario and, as a result, such a network needs to have routing protocols which can adopt dynamically changing topology. To accomplish this, a number of ad-hoc routing protocols have been proposed and implemented, which include Dynamic Source Routing (DSR), Ad-hoc On-demand Distance Vector Routing (AODV), and Temporally Ordered Routing Algorithm (TORA). Although considerable amount of simulation work has been done to measure the performance of these routing protocols, due to the constant changing nature of these protocols, a new performance evaluation is essential. Accordingly, in this thesis, we analyze the performance differentials to compare the above three commonly used ad-hoc network routing protocols. We also analyze the performance over varying loads for each of these protocols using OPNET Modeler 10.5. Our findings show that for specific differentials, TORA shows better performance over the two on-demand protocols i.e., DSR and AODV. Our findings are expected to lead to further performance improvements of various ad-hoc networks in the future.
Read More ↓Edition Statements
- Publication Date:2004
Thesis Information
- Degree:M.S.E.E.
- University:University of South Alabama
- Advisor/Supervisor:M. S. Alam
- Pages:77
Publication Statements
- Language:eng
- Publication Date:2004
Edition Identifiers
- proquest:305104530
Subjects
Writers
No reviews yet. Be the first to rate this work.
Rate & Review