Analysis of Dynamic Source Routing and Destination-Sequenced Distance-Vector Protocols for Different Mobility Models

Authors:
Bhavyesh Divecha;Ajith Abraham;Crina Grosan;Sugata Sanyal
Affiliations:
Mumbai University, India;Norwegian University of Science and Technology, Norway;Norwegian University of Science and Technology, Norway;Tata Institute of Fundamental Research, India
Venue:
AMS '07 Proceedings of the First Asia International Conference on Modelling & Simulation
Year:
2007

Citing 0
Cited 4

Realistic mobility simulation of urban mesh networks

Ad Hoc Networks
Performance study of ad hoc routing protocols with gossip-based approach

SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Performance analysis of routing protocols in mobile ad-hoc networks under group mobility environment

ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
The impact of simulation area shape on the performance of ad hoc networks

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A Mobile Ad-Hoc Network (MANET) is self-configuring network of mobile nodes connected by wireless links to form an arbitrary topology without the use of existing infrastructure. In this paper, we have studied the effects of various mobility models on the performance of two routing protocols Dynamic Source Routing (DSR-Reactive Protocol) and Destination-Sequenced Distance-Vector (DSDV-Proactive Protocol). For experiment purposes, we have considered four mobility scenarios: Random Wayward Mobility, Group Mobility, Freeway and Manhattan models. These four Mobility Models are selected to represent the possibility of practical application in future. Performance comparison has also been conducted across varying node densities and number of hops. Experiment results illustrate that performance of the routing protocol varies across different mobility models, node densities and length of data paths.