scispace - formally typeset
Open AccessJournal ArticleDOI

Comparative Analysis of AODV, OLSR, TORA, DSR and DSDV Routing Protocols in Mobile Ad-Hoc Networks

Dilpreet Kaur, +1 more
- 03 Mar 2012 - 
- Vol. 5, Iss: 3, pp 39-46
Reads0
Chats0
TLDR
This research paper describes the characteristics of ad hoc routing protocols Ad-hoc On Demand Distance Vector Routing (AODV), Optimized link State R routing (OLSR), Temporally Ordered Routing Algorithm (TORA), Dynamic Source Routing(DSR), Destination-Sequenced Distance-Vector Routed (DSDV) based on the performance metrics like packet delivery fraction, Average delay, Normalized Routing load, Throughput and Jitter.
Abstract
Mobile Ad-Hoc Networks (MANETs) are autonomous and decentralized wireless systems. Mobile Ad hoc Network is a collection of mobile nodes in which the wireless links are frequently broken down due to mobility and dynamic infrastructure. Routing is a significant issue and challenge in ad hoc networks. Many Routing protocols have been proposed so far to improve the routing performance and reliability. This research paper describes the characteristics of ad hoc routing protocols Ad-hoc On Demand Distance Vector Routing (AODV), Optimized link State Routing (OLSR), Temporally Ordered Routing Algorithm (TORA), Dynamic Source Routing (DSR), Destination-Sequenced Distance-Vector Routing (DSDV) based on the performance metrics like packet delivery fraction, Average delay, Normalized Routing load, Throughput and Jitter under low mobility and low traffic network as well as under high mobility and high traffic network. Results show that AODV has maximum throughput under low traffic and DSDV has maximum throughput under high traffic. As network becomes dense OLSR, DSR and DSDV perform well in terms of Throughput than AODV and TORA. TORA performs well in dense networks in terms of packet delivery fraction but at the same time Normalized Routing load of TORA is maximum among all the protocols in both the networks. DSDV has least Normalized Routing load in both low and high traffic. OLSR and DSDV give the least Jitter and Average Delay in both networks.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

A Comparative Performance Analysis of Routing Protocols in MANET using NS3 Simulator

TL;DR: Study of four routing protocols and performance comparisons between these routing protocols on the basis of performance metrics (throughput, packet delivery ratio, Packet dropped, jitter and end to end delay measured after simulation of network) with the help of NS3 Simulator.
Proceedings ArticleDOI

Intelligent route discovery for ZigBee mesh networks

TL;DR: This study proposes the use of a novel fuzzy-logic-based metric to be used in the decision making process of AODV, which shows a reduction in the communication delay, number of packets and overhead, improving route efficiency and reducing packet overload.
Journal ArticleDOI

Neural networks for MANET AODV: an optimization approach

TL;DR: Continuous Hopfield Neural Networks is used to optimize the route to seek an optimal or nearly-optimal route, which can improve the usability and survivability of MANET.
Journal ArticleDOI

Energy efficient hierarchical based fish eye state routing protocol for flying Ad-hoc networks

TL;DR: Experimental analysis slows that FSR is good in term of PDR, channel utilization, link utilization vs throughput and link vs throughput from the rest of routing protocols after addressing of these problems UAVs resources are efficiently utilized.
Proceedings ArticleDOI

Routing over Low Power and Lossy Networks protocol: Overview and performance evaluation

TL;DR: An overview of this protocol with a performance study of the two OFs used in RPL is provided, and a profound study by focusing on other important parameters with less focus is made.
References
More filters
Proceedings ArticleDOI

Ad-hoc on-demand distance vector routing

TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.

Dynamic Source Routing in Ad Hoc Wireless Networks.

TL;DR: In this article, the authors present a protocol for routing in ad hoc networks that uses dynamic source routing, which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Book ChapterDOI

Dynamic Source Routing in Ad Hoc Wireless Networks

TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Proceedings ArticleDOI

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.