A survey of mobility models for ad hoc network research

Abstract

In the performance evaluation of a protocol for an ad hoc network, the protocol should be tested under realistic conditions including, but not limited to, a sensible transmission range, limited buffer space for the storage of messages, representative data traffic models and realistic movements of the mobile users (i.e. a mobility model). This paper is a survey of mobility models that are used in the simulations of ad hoc networks. We describe several mobility models that represent mobile nodes whose movements are independent of each other (i.e. entity mobility models) and several mobility models that represent mobile nodes whose movements are dependent on each other (i.e. group mobility models). The goal of this paper is to present a number of mobility models in order to offer researchers more informed choices when they are deciding on a mobility model to use in their performance evaluations. Lastly, we present simulation results that illustrate the importance of choosing a mobility model in the simulation of an ad hoc network protocol. Specifically, we illustrate how the performance results of an ad hoc network protocol drastically change as a result of changing the mobility model simulated. Copyright © 2002 John Wiley & Sons, Ltd.

Scalable Video Multicast in Hybrid 3G/Ad-Hoc Networks

“…The random walk model with reflection mobility [16] is used to drive user movement in the simulation. The individual user's moving speed is randomly selected in a range from zero to maxspeed (m/s), where maxspeed is a simulation parameter.…”

A Monte Carlo localization method based on differential evolution optimization applied into economic forecasting in mobile wireless sensor networks

“…The specific parameters are set in details as follows: the number of sensor nodes is 320, the deployment area is 500 × 500 m 2 ; the transmission radius of sensor node is r = 50 m; the number of valid samples is N = 50. The motion process of the node employs RWP model [20], and the maximum moving speed v max = 0.2r. Besides, the main parameters of differential evolution are set as: η=0.8, ρ 0 = 0.4, and ρ* = 0.9.…”

“…The Monte Carlo localization method is based on the Bayes filtering theory, and the main idea is by utilizing the new observation from the adjacent anchor nodes within the range, the sample and filter steps will be repeated until enough valid samples can be obtained. Then, the blind node can estimate its current location as it completes the movement [20]. Therefore, the resolution of the blind node's localization can be transferred into the posterior probability density function.…”

An Energy Efficient Tracking Method in Wireless Sensor Networks

“…Initially, each mobile node is assigned a current speed and direction. Specifically, the value of speed and direction at the th n instance is calculated based upon the value of speed and direction at the th n ) 1 ( − instance and a random variable [11]. Energy consumption used for simulation is based on some numeric parameters obtained in [2].…”