Investigation of Mobility Model Against Reactive Routing Protocols in MANETs
Journal Title: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY - Year 2013, Vol 8, Issue 1
Abstract
Ad-hoc network is a collection of wireless mobile nodes which dynamically form a temporary network without the use of any existing network infrastructure or centralized administration. It may connect hundreds to thousands of mobile nodes. The mobile nodes communicate directly with each other without the aid of access points. They form an arbitrary topology, where the routers are free to move randomly and arrange themselves as required. In this paper, an attempt has been made to investigate the impact of mobility models on the performance of three MANET on-demand reactive routing protocols: AODV, DSR and DYMO. The mobility models that are used in this work are: Random Waypoint mobility model and Group mobility model. The performance differentials are analyzed using varying network size, varying pause time, and varying velocity. We used Qual-Net [18] from scalable networks for the simulation purpose. The performance analysis is based on different network metrics such as packet delivery ratio, throughput, average end –to –end delay and average jitter.
Authors and Affiliations
Shruti Bajaj, Er. Rajdeep Singh, Er. Parveen Kakkar
Multi-factor analysis of pair programming based on PSP methodology
In regard with designing software, users play key role. In order to design software, it is necessary to observe standard principles of designation, using templates and using modern methods. Over the decades, using...
A Novel LAS-Relief Feature Selection Algorithm for Enhancing Classification Accuracy in Data mining
Feature selection is an important task in data mining and machine learning domain. The main objective of feature selection is to find a relevant feature that predicts the knowledge better than the original set of feature...
On the Cloud Web services: A Review
Cloud Computing is a constantly evolving IT generic term used to refer to various IT solutions and services provided via the internet. Precisely, cloud computing can be said to be  the delivery of scalable IT resource...
ALGORITHM FOR THE ANALYSIS OF EXACTICTY OF BANERJEE TEST
In compiler theory, the Banerjee test is a dependence test. The Banerjee test assumes that all loop indices are independent, however in reality, this is often not true. The Bannerjee test is a conservative test. That is,...
Genetic Algorithm for solving flow problems in a Stochastic-flow Network under Budget Constraints
The system reliability (Rd,c) calculation is based on the generation of all the lower boundary points for the given demand, d, such that the total transmission cost is less than or equal to c (budget). This generation of...