Data Delivery Properties of Human Contact Networks

Pocket Switched Networks take advantage of social contacts to opportunistically create data paths over time. This work employs empirical traces to examine the effect of the human contact process on data delivery in such networks. The contact occurrence distribution is found to be highly uneven: contacts between a few node pairs occur too frequently, leading to inadequate mixing in the network, while the majority of contacts occur rarely, but are essential for global connectivity. This distribution of contacts leads to a significant variation in the fraction of node pairs that can be connected over time windows of similar duration. Good time windows tend to have a large clique of nodes that can all reach each other. It is shown that the clustering coefficient of the contact graph over a time window is a good predictor of achievable connectivity. We then examine all successful paths found by flooding and show that though delivery times vary widely, randomly sampling a small number of paths between each source and destination is sufficient to yield a delivery time distribution close to that of flooding over all paths. This result suggests that the rate at which the network can deliver data is remarkably robust to path failures.

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

[2]  Vijay Erramilli,et al.  Diversity of forwarding paths in pocket switched networks , 2007, IMC '07.

[3]  Liam McNamara,et al.  Media sharing based on colocation prediction in urban transport , 2008, MobiCom '08.

[4]  Pan Hui,et al.  Pocket switched networks and human mobility in conference environments , 2005, WDTN '05.

[5]  A. W. Kemp,et al.  Univariate Discrete Distributions , 1993 .

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

[7]  Ger Koole,et al.  The message delay in mobile ad hoc networks , 2005, Perform. Evaluation.

[8]  Deborah Estrin,et al.  Computing aggregates for monitoring wireless sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[9]  A. W. Kemp,et al.  Univariate Discrete Distributions , 1993 .

[10]  Vito Latora,et al.  Selfishness, Altruism and Message Spreading in Mobile Social Networks , 2009, IEEE INFOCOM Workshops 2009.

[11]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[12]  Brian D. Noble,et al.  Modeling epidemic spreading in mobile environments , 2005, WiSe '05.

[13]  Richard M. Brugger Univariate Discrete Distributions (2nd Ed.) , 1994 .

[14]  Mads Haahr,et al.  Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.

[15]  Pan Hui,et al.  Pocket Switched Networks and the Consequences of Human Mobility in Conference Environments , 2005, SIGCOMM 2005.

[16]  Pan Hui,et al.  Visualizing community detection in opportunistic networks , 2007, CHANTS '07.

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

[18]  Vijay Erramilli,et al.  Delegation forwarding , 2008, MobiHoc '08.

[19]  Robin I. M. Dunbar Coevolution of neocortical size, group size and language in humans , 1993, Behavioral and Brain Sciences.

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

[21]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[22]  Robin I. M. Dunbar CO-EVOLUTION OF NEOCORTEX SIZE , GROUP SIZE AND LANGUAGE IN HUMANS , 2008 .

[23]  Zygmunt J. Haas,et al.  The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way) , 2003, MobiHoc '03.

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

[25]  Vinton G. Cerf,et al.  Delay-tolerant networking: an approach to interplanetary Internet , 2003, IEEE Commun. Mag..

[26]  T. Spyropoulos,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[27]  Mark S Handcock,et al.  Center for Studies in Demography and Ecology Interval Estimates for Epidemic Thresholds in Two-Sex Network Models , 2005 .

[28]  Donald F. Towsley,et al.  Performance modeling of epidemic routing , 2006, Comput. Networks.

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

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

[31]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[32]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[33]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM '07.