Characterizing pairwise inter-contact patterns in delay tolerant networks

A good understanding of contact patterns in delay tolerant networks (DTNs) is elemental to the design of effective routing or content distribution schemes. Prior work has typically focused on inter-contact time patterns in the aggregate. In this paper, we argue that pairwise inter-contact patterns are a more refined and efficient tool for characterizing DTNs. First, we provide a detailed statistical analysis of pairwise contact and inter-contact times in three reference DTN data sets. We characterize heterogeneities in contact times and inter-contact times, and find that the empirical distributions of inter-contact times tend to be well fitted by log-normal curves, with exponential curves also fitting a significant portion of the distributions. Second, we investigate analytically the relationship between pairwise and aggregate inter-contact times. In particular, we consider both the exponential and log-normal cases and show analytically how the aggregation of pairwise inter-contacts may lead to aggregate inter-contacts with power laws of various degrees.

[1]  H. L. Dryden,et al.  Investigations on the Theory of the Brownian Movement , 1957 .

[2]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[3]  William Feller,et al.  An Introduction to Probability Theory and Its Applications, Vol. 2 , 1967 .

[4]  P. A. P. Moran,et al.  An introduction to probability theory , 1968 .

[5]  W. T. Eadie,et al.  Statistical Methods in Experimental Physics , 1973 .

[6]  E. Montroll,et al.  On 1/f noise and other distributions with long tails. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

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

[8]  W. Reed.  The Pareto law of incomes—an explanation and an extension , 2003 .

[9]  Michael Mitzenmacher,et al.  A Brief History of Generative Models for Power Law and Lognormal Distributions , 2004, Internet Math..

[10]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[11]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[12]  Cauligi S. Raghavendra,et al.  Single-copy routing in intermittently connected mobile networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[13]  Last Encounter Routing under Random Waypoint Mobility , 2004, NETWORKING.

[14]  Tristan Henderson,et al.  The changing usage of a mature campus-wide wireless network , 2004, MobiCom '04.

[15]  Ravi Jain,et al.  Evaluating location predictors with extensive Wi-Fi mobility data , 2004, INFOCOM.

[16]  Tristan Henderson,et al.  CRAWDAD: A Community Resource for Archiving Wireless Data at Dartmouth , 2005, IEEE Pervasive Comput..

[17]  Kevin C. Almeroth,et al.  Delay Tolerant Mobile Networks (DTMNs): Controlled Flooding in Sparse Mobile Networks , 2005, NETWORKING.

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

[19]  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.

[20]  Serge Fdida,et al.  Reconsidering microscopic mobility modeling for self-organizing networks , 2006, IEEE Network.

[21]  Timur Friedman,et al.  Evaluating Mobility Pattern Space Routing for DTNs , 2005, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[22]  Imrich Chlamtac,et al.  A Framework for Opportunistic Forwarding in Disconnected Networks , 2006, 2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services.

[23]  Mingyan Liu,et al.  Building realistic mobility models from coarse-grained traces , 2006, MobiSys '06.

[24]  Cecilia Mascolo,et al.  A community based mobility model for ad hoc network research , 2006, REALMAN '06.

[25]  Guy Leduc,et al.  Predictable Disruption Tolerant Networks and Delivery Guarantees , 2006, ArXiv.

[26]  Paul A. S. Ward,et al.  Practical Routing in Delay-Tolerant Networks , 2005, IEEE Transactions on Mobile Computing.