Building realistic mobility models from coarse-grained traces

In this paper we present a trace-driven framework capable of building realistic mobility models for the simulation studies of mobile systems. With the goal of realism, this framework combines coarse-grained wireless traces, i.e., association data between WiFi users and access points, with an actual map of the space over which the traces were collected. Through a sequence of data processing steps, including filtering the data trace and converting the map to a graph representation, this framework generates a probabilistic mobility model that produces user movement patterns that are representative of real movement. This is done by adopting a set of heuristics that help us infer the paths users take between access points. We describe our experience applying this approach to a college campus, and study a number of properties of the trace data using our framework.

[1]  Tristan Henderson,et al.  The changing usage of a mature campus-wide wireless network , 2004, MobiCom '04.

[2]  Ahmed Helmy,et al.  Towards mobility-rich analysis in ad hoc networks: using contraction, expansion and hybrid models , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[3]  William Lau,et al.  Networked game mobility model for first-person-shooter games , 2005, NetGames '05.

[4]  P. Rousseeuw,et al.  Wiley Series in Probability and Mathematical Statistics , 2005 .

[5]  Jean-Yves Le Boudec.  Understanding the simulation of mobility models with Palm calculus , 2007, Perform. Evaluation.

[6]  Paolo Santi,et al.  The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[7]  Tracy Camp,et al.  Stationary distributions for the random waypoint mobility model , 2004, IEEE Transactions on Mobile Computing.

[8]  Guevara Noubir,et al.  Mobility models for ad hoc network simulation , 2004, IEEE INFOCOM 2004.

[9]  Kevin C. Almeroth,et al.  Towards realistic mobility models for mobile ad hoc networks , 2003, MobiCom '03.

[10]  Klaus Herrmann,et al.  Modeling the sociological aspects of mobility in ad hoc networks , 2003, MSWIM '03.

[11]  Patrick Billingsley,et al.  Probability and Measure. , 1986 .

[12]  Mingyan Liu,et al.  Sound mobility models , 2003, MobiCom '03.

[13]  Louise E. Moser,et al.  An analysis of the optimum node density for ad hoc mobile networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[14]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[15]  Cecilia Mascolo,et al.  An ad hoc mobility model founded on social network theory , 2004, MSWiM '04.

[16]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[17]  Xiaoyan Hong,et al.  A group mobility model for ad hoc wireless networks , 1999, MSWiM '99.

[18]  C. J. Stone,et al.  Introduction to Stochastic Processes , 1972 .

[19]  E. Lawler.  A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .

[20]  Ravi Jain,et al.  Evaluating location predictors with extensive Wi-Fi mobility data , 2003, IEEE INFOCOM 2004.

[21]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.