A survey of mobility models for ad hoc network research

  title={A survey of mobility models for ad hoc network research},
  author={Tracy Camp and Jeff Boleng and Vanessa Davies},
  journal={Wirel. Commun. Mob. Comput.},
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… 
Mobility Models in Mobile Ad Hoc Network
A number of mobility models used to model the ad hoc network and the performance of the routing protocol is dependent on the more realistic models are presented.
Implementation and Comparison of Mobility Models in NS-2
3 mobility models that represent mobile nodes whose movements are independent of each other (i.e., entity mobility models) are described and the importance of choosing a mobility model in the simulation of an ad hoc network protocol is illustrated.
Analysis of Location Management Schemes for MANET using Synthetic Mobility Models
The goal of this paper is to simulate the movements of mobile nodes within a network and present a number of mobility models in order to demonstrate its effect on Location management scheme for mobile ad hoc network or personal communication services networks.
Building of a Competent Mobility Model for Ad Hoc Wireless Networks
An attempt has been made by proposing a new mobility model called restriction models for generating unusual mobility scenarios for Ad Hoc networks such as campus scenario which shows that the proposed algorithm has outperform the available mobility model for campus scenario.
Mobility Scenario of Dissimilar Mobility Models using the DSR Protocol in Ad-hoc Sensor Network-A Survey
A number of mobility models are presented in order to offer researchers more well-versed choices when they are deciding on a mobility model to use in their performance evaluations and are discussed on a variety of simulation settings and parameters.
Towards realistic mobility models for mobile ad hoc networks
Simulation results show that the use of obstacles and pathways has a significant impact on the performance of ad hoc network protocols.
A New Optimistic Mobility Model for Mobile Ad Hoc Networks
A complete environment in which network protocols can be studied on the basis of numerous performance metrics is developed and it is observed that the performance of ad hoc network protocols is affected when different mobility scenarios are utilized.
A Simulation Study with Mobility Models Based on Routing Protocol
A relative analysis of mobility models existing, are discussed on a variety of simulation setting parameter like packet delivery rate (PDR), Throughput, Average End to End Delay to devise more suitable choice for performance evaluation using routing protocols.
This paper provides survey and classification of existing mobility models, and discusses various mobility models that exhibit the characteristics of temporal dependency, spatial dependency and geographic constraints.
A Classification and Performance Comparison of Mobility Models for Ad Hoc Networks
A survey and a new hybrid classification of existing mobility models in the literature are provided and the random direction and boundless simulation area models on Scalable Wireless Ad Hoc Network Simulator (SWANS) are implemented.


A group mobility model for ad hoc wireless networks
It is shown that group motion occurs frequently in ad hoc networks, and a novel group mobility model Reference Point Group Mobility (RPGM) is introduced to represent the relationship among mobile hosts.
Scenario-based performance analysis of routing protocols for mobile ad-hoc networks
This study is a comparison of three routing protocols proposed for wireless mobile ad-hoc networks, and in most simulations the reactive protocols (AODV and DSR) performed significantly better than DSDV.
Dynamic Source Routing in Ad Hoc Wireless Networks
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.
Performance comparison of two location based routing protocols for ad hoc networks
A detailed performance evaluation on two location based routing protocols: location-aided routing (LAR) and distance routing effect algorithm for mobility (DREAM) and their implementation provides a simple location service that could be used with other ad hoc network routing protocols.
Predictive distance-based mobility management for PCS networks
  • B. Liang, Z. Haas
  • Computer Science
    IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320)
  • 1999
An analytical framework is described to evaluate the cost of mobility management for the proposed predictive distance-based scheme, which is obtained through simulations and demonstrated under various mobility and call patterns, update cost, page cost, and frequencies of mobile location inspections.
An analysis of the optimum node density for ad hoc mobile networks
It is shown that there does not exist a global optimum density, but rather that, to achieve this maximum, the node density should increase as the rate of node movement increases.
ANEJOS: a Java based simulator for ad hoc networks
User Mobility Modeling and Characterization of Mobility Patterns
It is shown that the cell residence time can be described by the generalized gamma distribution and the negative exponential distribution is a good approximation for describing the channel holding time.
A distance routing effect algorithm for mobility (DREAM)
A new routing protocol for ad hoc networks built around two novel observations, one of triggering the sending of location updates by the moving nodes autonomously, based on a node's mobility rate, and the other of minting the overhead used for maintaining routes using the two new principlw of update message frequency and distance.
A wireless hierarchical routing protocol with group mobility
A novel soft state wireless hierarchical routing protocol-Hierarchical State Routing (HSR) is proposed, which keeps track of logical subnet movements using home agent concepts akin to Mobile IP.