By Topic

Graph-based mobility model for mobile ad hoc network simulation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Tian, J. ; Inst. of Parallel & Distributed High-Performance Syst. (IPVR), Stuttgart Univ., Germany ; Hähner, J. ; Becker, C. ; Stepanov, I.
more authors

Imagine a world where people constantly try to pass through walls and cars suddenly leave the roads and drive into rivers. Although this is unrealistic, most simulations for mobile ad hoc networks so far are based on the so called "random walk" of mobile objects, which are not constrained by their surrounding spatial environments. In this paper we propose a novel graph-based mobility model, which provides a more realistic movement than the random walk model by reflecting the spatial constraints in the real world. We analyzed three commonly used ad hoc network routing protocols, DSDV, DSR and AODV with both a random walk-based and our graph-based mobility model. Our simulation results show that the spatial constraints have a strong impact on the performance of ad hoc routing protocols.

Published in:

Simulation Symposium, 2002. Proceedings. 35th Annual

Date of Conference:

14-18 April 2002