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. It can be viewed as the discrete version of the Random Trip model: including all variants of the Random Way-Point model [15]. We derive fundamental properties and explicit analytical formulas for the stationary probability distributions yielded by the Markov Trace model. Besides having a per-se interest, such results can be exploited to compute formulas and properties for concrete cases by just applying counting arguments. We apply the above general results to the discrete version of the Manhattan Random Way-Point. We get explicit formulas for the total stationary distribution and for two important conditional distributions: the agent spatial and the agent destination ones. Our method makes the analysis of complex mobile systems a feasible task. As a further evidence of this important fact, we 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. (C) 2010 Elsevier B.V. All rights reserved.

Modelling mobility: A discrete revolution / Andrea, Clementi; Monti, Angelo; Silvestri, Riccardo. - In: AD HOC NETWORKS. - ISSN 1570-8705. - STAMPA. - 9:6(2011), pp. 998-1014. [10.1016/j.adhoc.2010.09.002]

Modelling mobility: A discrete revolution

MONTI, Angelo;SILVESTRI, RICCARDO
2011

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. It can be viewed as the discrete version of the Random Trip model: including all variants of the Random Way-Point model [15]. We derive fundamental properties and explicit analytical formulas for the stationary probability distributions yielded by the Markov Trace model. Besides having a per-se interest, such results can be exploited to compute formulas and properties for concrete cases by just applying counting arguments. We apply the above general results to the discrete version of the Manhattan Random Way-Point. We get explicit formulas for the total stationary distribution and for two important conditional distributions: the agent spatial and the agent destination ones. Our method makes the analysis of complex mobile systems a feasible task. As a further evidence of this important fact, we 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. (C) 2010 Elsevier B.V. All rights reserved.
2011
discrete markov chains; mobile ad-hoc networks; models of mobility
01 Pubblicazione su rivista::01a Articolo in rivista
Modelling mobility: A discrete revolution / Andrea, Clementi; Monti, Angelo; Silvestri, Riccardo. - In: AD HOC NETWORKS. - ISSN 1570-8705. - STAMPA. - 9:6(2011), pp. 998-1014. [10.1016/j.adhoc.2010.09.002]
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/377974
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 10
  • ???jsp.display-item.citation.isi??? 7
social impact