Modelling Mobility: A Discrete Revolution

Abstract

We introduce a new approach to model and analyze Mobility. It is fully based on discrete mathematics and yields a class of mobility models, called the Markov Trace Model. This model can be seen as the discrete version of the Random Trip Model: including all variants of the Random Way-Point Model [14]. We derive fundamental properties and explicit analytical formulas for the stationary distributions yielded by the Markov Trace Model. Such results can be exploited to compute formulas and properties for concrete cases of the Markov Trace Model by just applying counting arguments. We apply the above general results to the discrete version of the Manhattan Random Way-Point over a square of bounded size. We get formulas for the total stationary distribution and for two important conditional ones: the agent spatial and destination distributions. Our method makes the analysis of complex mobile systems a feasible task. As a further evidence of this important fact, we first model a complex vehicular-mobile system over a set of crossing streets. Several concrete issues are implemented such as parking zones, traffic lights, and variable vehicle speeds. By using a modular version of the Markov Trace Model, we get explicit formulas for the stationary distributions yielded by this vehicular-mobile model as well.