SPoT: Representing the social, spatial, and temporal dimensions of human mobility with a unifying framework

Abstract Modeling human mobility is crucial in the analysis and simulation of opportunistic networks, where contacts are exploited as opportunities for peer-to-peer message forwarding. The current approach to human mobility modeling has been based on continuously modifying models, trying to embed in them the mobility properties (e.g., visiting patterns to locations or specific distributions of inter-contact times) as they arose from trace analysis. As a consequence, with these models it is difficult, if not impossible, to modify the features of mobility or to control the exact shape of mobility metrics (e.g., modifying the distribution of inter-contact times). For these reasons, in this paper we propose a mobility framework rather than a mobility model, with the explicit goal of providing a flexible and controllable tool for modeling mathematically and generating simulatively different possible features of human mobility. Our framework, named SPoT, is able to incorporate the three dimensions–spatial, social, and temporal–of human mobility. The way SPoT does this is by mapping the different social communities of the network into different locations, whose members visit with a configurable temporal pattern. In order to characterize the temporal patterns of user visits to locations and the relative positioning of locations based on their shared users, we analyze the traces of real user movements extracted from three location-based online social networks (Gowalla, Foursquare, and Altergeo). We observe that a Bernoulli process effectively approximates user visits to locations in the majority of cases, and that locations that share many common users visiting them frequently tend to be located close to each other. In addition, we use these traces to test the flexibility of the framework, and we show that SPoT is able to accurately reproduce the mobility behavior observed in traces. Finally, relying on the Bernoulli assumption for arrival processes, we provide a thorough mathematical analysis of the controllability of the framework, deriving the conditions under which heavy-tailed and exponentially-tailed aggregate inter-contact times (often observed in real traces) emerge.

[1]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SimuTools.

[2]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[3]  Christophe Diot,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.

[4]  Daniel Br New Methods to Color the Vertices of a Graph , 1979 .

[5]  Marcelo Dias de Amorim,et al.  Density-Aware Routing in Highly Dynamic DTNs: The RollerNet Case , 2011, IEEE Transactions on Mobile Computing.

[6]  Serge Fdida,et al.  SIMPS: Using Sociology for Personal Mobility , 2006, IEEE/ACM Transactions on Networking.

[7]  Mathieu Bastian,et al.  ForceAtlas2, A Graph Layout Algorithm for Handy Network Visualization , 2011 .

[8]  Timur Friedman,et al.  Characterizing pairwise inter-contact patterns in delay tolerant networks , 2007, Autonomics.

[9]  Cecilia Mascolo,et al.  Where Online Friends Meet: Social Communities in Location-Based Networks , 2012, ICWSM.

[10]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[11]  Ahmed Helmy,et al.  Modeling Spatial and Temporal Dependencies of User Mobility in Wireless Mobile Networks , 2008, IEEE/ACM Transactions on Networking.

[12]  Chaoming Song,et al.  Modelling the scaling properties of human mobility , 2010, 1010.0436.

[13]  Marco Conti,et al.  Opportunistic networking: data forwarding in disconnected mobile ad hoc networks , 2006, IEEE Communications Magazine.

[14]  Mirco Musolesi Questions and Comments Cis6930 Presentation Pertaining to Publication: Mirco Musolesi , Cecilia Mascolo, Designing Mobility Models Based on Social Network Theory, Acm Sigmobile Mobile Computing and Communications Review , 2009 .

[15]  VojnovicMilan,et al.  Power Law and Exponential Decay of Intercontact Times between Mobile Devices , 2010 .

[16]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[17]  Andrea Passarella,et al.  HCMM: Modelling spatial and temporal properties of human mobility driven by users' social relationships , 2010, Comput. Commun..

[18]  Moshe Zukerman,et al.  Introduction to Queueing Theory and Stochastic Teletraffic Models , 2013, ArXiv.

[19]  Hal A. Kierstead,et al.  A Simple Competitive Graph Coloring Algorithm , 2000, J. Comb. Theory B.

[20]  Marco Conti,et al.  An arrival-based framework for human mobility modeling , 2012, 2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM).

[21]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2011 .

[22]  Marco Conti,et al.  Ego network models for Future Internet social networking environments , 2012, Comput. Commun..

[23]  Julia Silvis,et al.  Travel Diary , 2008 .

[24]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[26]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[27]  Xiaoyan Hong,et al.  Agenda driven mobility modelling , 2010, Int. J. Ad Hoc Ubiquitous Comput..

[28]  Albert-László Barabási,et al.  Understanding individual human mobility patterns , 2008, Nature.

[29]  M. Jacomy,et al.  ForceAtlas2, a Continuous Graph Layout Algorithm for Handy Network Visualization Designed for the Gephi Software , 2014, PloS one.

[30]  T. Geisel,et al.  The scaling laws of human travel , 2006, Nature.

[31]  Albert-László Barabási,et al.  Limits of Predictability in Human Mobility , 2010, Science.

[32]  Jure Leskovec,et al.  Friendship and mobility: user movement in location-based social networks , 2011, KDD.

[33]  Jean-Yves Le Boudec,et al.  Power Law and Exponential Decay of Intercontact Times between Mobile Devices , 2010, IEEE Trans. Mob. Comput..

[34]  Thrasyvoulos Spyropoulos,et al.  Putting contacts into context: mobility modeling beyond inter-contact times , 2011, MobiHoc '11.

[35]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[36]  Jin-Kao Hao,et al.  Hybrid Evolutionary Algorithms for Graph Coloring , 1999, J. Comb. Optim..

[37]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[38]  Cecilia Mascolo,et al.  Designing mobility models based on social network theory , 2007, MOCO.

[39]  Marco Conti,et al.  Human mobility models for opportunistic networks , 2011, IEEE Communications Magazine.

[40]  E. Lehmann Testing Statistical Hypotheses , 1960 .

[41]  Pasquale De Meo,et al.  Analyzing the Facebook Friendship Graph , 2010, ArXiv.

[42]  Marco Conti,et al.  Analysis of individual pair and aggregate inter-contact times in heterogeneous opportunistic networks-Technical Report , 2012 .

[43]  Hal A. Kierstead,et al.  A simple competitive graph coloring algorithm III , 2004, J. Comb. Theory B.

[44]  Qinghua Li,et al.  Multicasting in delay tolerant networks: a social network perspective , 2009, MobiHoc '09.

[45]  Thrasyvoulos Spyropoulos,et al.  Collection and analysis of multi-dimensional network data for opportunistic networking research , 2012, Comput. Commun..

[46]  Injong Rhee,et al.  SLAW: A New Mobility Model for Human Walks , 2009, IEEE INFOCOM 2009.

[47]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[48]  Jörg Ott,et al.  Working day movement model , 2008, MobilityModels '08.

[49]  Marco Conti,et al.  Exploiting users' social relations to forward data in opportunistic networks: The HiBOp solution , 2008, Pervasive Mob. Comput..