Issue No. 11 - Nov. (2013 vol. 12)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2012.184
Sahin Cem Geyik , Rensselaer Polytechnic Institute, Troy
Eyuphan Bulut , Rensselaer Polytechnic Institute, Troy
Boleslaw K. Szymanski , Rensselaer Polytechnic Institute, Troy
Modeling of the mobility patterns arising in computer networks requires a compact and faithful representation of the mobility data collected from observations and measurements of the relevant network applications. This data can range from the information on the mobility of the agents that are being monitored by a wireless network to mobility information of nodes in mobile network applications. In this paper, we examine the use of probabilistic context-free grammars as the modeling framework for such data. We present a fast algorithm for deriving a concise probabilistic context-free grammar from the given training data. The algorithm uses an evaluation metric based on Bayesian formula for maximizing grammar a posteriori probability given the training data. We describe the application of this algorithm in two mobility modeling domains: 1) recognizing mobility patterns of monitored agents in different event data sets collected by sensor networks, and 2) modeling and generating node movements in mobile networks. We also discuss the model's performance in simulations utilizing both synthetic and real-world mobility traces.
Grammar, Training data, Computational modeling, Data models, Mobile computing, Production, Context
S. C. Geyik, E. Bulut and B. K. Szymanski, "Grammatical Inference for Modeling Mobility Patterns in Networks," in IEEE Transactions on Mobile Computing, vol. 12, no. 11, pp. 2119-2131, 2013.