scispace - formally typeset
Open Access

Routing Protocols in Mobile Ad-hoc Networks \

Reads0
Chats0
TLDR
This paper presents the traces of communication between different mobile nodes using Routing Protocols in MANETs and analyzes the simulation results by graphical manner and trace file based on QoS metrics such as Throughput, Drop, Delay, Jitter etc.
Abstract
A Mobile Ad Hoc Networks (MANETs) is a group of mobile nodes which cooperate in forwarding packets in a multi-hop fashion without any centralized administration. One of its key challenges is routing. Many routing protocols for MANET have been proposed and the protocols can be classified as proactive routing and on demand routing protocols. This paper uses ns-2 as the simulation tool, 802.11 as the wireless MAC protocol, and AODV & DSDV as the routing protocol. We present the traces of communication between different mobile nodes using Routing Protocols in MANETs. To compare the performance of Proactive and Reactive routing protocol, we have to analyze the simulation results by graphical manner and trace file based on QoS metrics such as Throughput, Drop, Delay, Jitter etc. Here, we have analyzed the simulation result by traces files only. The performance differentials have been analyzed based on network load, mobility, and network size. INDEX TERMS DSDV, AODV, MANET, QoS, Network Simulator-2 (NS2).

read more

Content maybe subject to copyright    Report

Citations
More filters

Survey of Routing Protocols for Mobile Ad-hoc Network

Humayun Bakht
TL;DR: Most of the routing protocols reported in the available literature are critically analyzed to help in having a wider understanding of the problem domain and can be used to develop or some new or to extend already proposed schemes.

An Overview of Routing Protocols in Mobile Ad-Hoc Network

TL;DR: Routing techniques which is the most challenging issue due to the dynamic topology of ad hoc networks are concentrates on.

Performance Evaluation and Comparison of AODV and AOMDV

TL;DR: On comparing the performance of AODV and AOMDV, AomDV incurs more routing overhead and packet delay than A ODV but it had a better efficiency when it comes to number of packets dropped and packet delivery.

PERFORMANCE METRIC COMPARISON OF AODV AND DSDV ROUTING PROTOCOLS IN MANETs USING NS-2

TL;DR: A network simulator-2 (NS-2) called MobiREAL simulator has been designed and developed for performance evaluation of AODV and DSDV routing protocol and the results were analyzed based on Quality of Service (QoS) metrics: such as throughput, drop, delay and jitter.
References
More filters

Ad hoc On-Demand Distance Vector (AODV) Routing

TL;DR: A logging instrument contains a pulsed neutron source and a pair of radiation detectors spaced along the length of the instrument to provide an indication of formation porosity which is substantially independent of the formation salinity.
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.