Power Law and Exponential Decay of Intercontact Times between Mobile Devices

We examine the fundamental properties that determine the basic performance metrics for opportunistic communications. We first consider the distribution of intercontact times between mobile devices. Using a diverse set of measured mobility traces, we find as an invariant property that there is a characteristic time, order of half a day, beyond which the distribution decays exponentially. Up to this value, the distribution in many cases follows a power law, as shown in recent work. This power law finding was previously used to support the hypothesis that intercontact time has a power law tail, and that common mobility models are not adequate. However, we observe that the timescale of interest for opportunistic forwarding may be of the same order as the characteristic time, and thus, the exponential tail is important. We further show that already simple models such as random walk and random waypoint can exhibit the same dichotomy in the distribution of intercontact time as in empirical traces. Finally, we perform an extensive analysis of several properties of human mobility patterns across several dimensions, and we present empirical evidence that the return time of a mobile device to its favorite location site may already explain the observed dichotomy. Our findings suggest that existing results on the performance of forwarding schemes based on power law tails might be overly pessimistic.

[1]  M. Vojnovic,et al.  The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation , 2006, IEEE/ACM Transactions on Networking.

[2]  L. Breuer Introduction to Stochastic Processes , 2022, Statistical Methods for Climate Scientists.

[3]  Geoffrey M. Voelker,et al.  Access and mobility of wireless PDA users , 2003, MOCO.

[4]  Pan Hui,et al.  Impact of human mobility on the performance of opportunistic forwarding algorithms , 2006, INFOCOM 2006.

[5]  Pan Hui,et al.  Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[6]  Christophe Diot,et al.  CRAWDAD dataset cambridge/haggle (v.2006-01-31) , 2006 .

[7]  Devavrat Shah,et al.  Optimal throughput-delay scaling in wireless networks - part I: the fluid model , 2006, IEEE Transactions on Information Theory.

[8]  R. Yuan North American dedicated short range communications (DSRC) standards , 1997, Proceedings of Conference on Intelligent Transportation Systems.

[9]  Eugene Seneta,et al.  Non‐Negative Matrices , 1975 .

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

[11]  Eric Horvitz,et al.  The Microsoft Multiperson Location Survey , 2005 .

[12]  Alex Pentland,et al.  Reality mining: sensing complex social systems , 2006, Personal and Ubiquitous Computing.

[13]  Ellen W. Zegura,et al.  Capacity Enhancement using Throwboxes in DTNs , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[14]  Nicholas F. Maxemchuk,et al.  Routing in the Manhattan Street Network , 1987, IEEE Trans. Commun..

[15]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

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

[17]  Nathan Eagle,et al.  CRAWDAD dataset mit/reality (v.2005-07-01) , 2005 .