The heterogeneity of inter-contact time distributions: its importance for routing in delay tolerant networks

Prior work on routing in delay tolerant networks (DTNs) has commonly made the assumption that each pair of nodes shares the same inter-contact time distribution as every other pair. The main argument in this paper is that researchers should also be looking at heterogeneous inter-contact time distributions. We demonstrate the presence of such heterogeneity in the often-used Dartmouth Wi-Fi data set. We also show that DTN routing can benefit from knowing these distributions. We first introduce a new stochastic model focusing on the inter-contact time distributions between all pairs of nodes, which we validate on real connectivity patterns. We then analytically derive the mean delivery time for a bundle of information traversing the network for simple single copy routing schemes. The purpose is to examine the theoretic impact of heterogeneous inter-contact time distributions. Finally, we show that we can exploit this user diversity to improve routing performance .

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

[2]  Alex Pentland,et al.  Social serendipity: mobilizing social software , 2005, IEEE Pervasive Computing.

[3]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

[4]  T. Spyropoulos,et al.  Multiple-copy Routing in Intermittently Connected Mobile Networks , 2004 .

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

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

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

[8]  D. Vere-Jones Markov Chains , 1972, Nature.

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

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

[11]  F. James Statistical Methods in Experimental Physics , 1973 .

[12]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

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

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