Provenance-driven data dissemination in disruption tolerant networks

Disruption Tolerant Networks (DTNs) are characterized by low node density, unpredictable node mobility and lack of global network information. Most of the current research efforts in DTNs focus on data forwarding, but only limited work has examined the problem of providing effective access of fused information to mobile users. In this paper, we examine a QoI metric — provenance (“to come from”) — which enables a user to establish trust in an information product that is obtained by fusing raw data from one or more information sources (with varying degrees of trust). In particular, we examine a semi-ring model for provenance that allows us to quantify and compare “provenance levels” and propose a novel approach to support provenance queries in DTNs using a cooperative in-network caching approach. To address the challenges of opportunistic network connectivity in DTNs, our basic idea is to intentionally cache both data and its provenance at a set of Network Central Locations (NCLs), which can be easily accessed by other nodes in the network. We propose an effective scheme which ensures appropriate NCL selection based on a probabilistic selection metric, and furthermore coordinate multiple caching nodes to optimize the tradeoff between quality (provenance level), data accessibility and caching overhead. By extensive trace-driven simulations, we show that our proposed caching scheme significantly improves the performance of data access, in terms of the provenance level and data access delay, compared to existing schemes.

[1]  Duane Wessels,et al.  ICP and the Squid web cache , 1998, IEEE J. Sel. Areas Commun..

[2]  Val Tannen,et al.  Provenance semirings , 2007, PODS.

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

[4]  Minglu Li,et al.  Recognizing Exponential Inter-Contact Time in VANETs , 2010, 2010 Proceedings IEEE INFOCOM.

[5]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

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

[7]  Guohong Cao,et al.  Supporting cooperative caching in ad hoc networks , 2004, IEEE Transactions on Mobile Computing.

[8]  Jie Wu,et al.  Predict and relay: an efficient routing in disruption-tolerant networks , 2009, MobiHoc '09.

[9]  Stratis Ioannidis,et al.  Optimal and scalable distribution of content updates over a mobile social network , 2009, IEEE INFOCOM 2009.

[10]  Cecilia Mascolo,et al.  Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks , 2008, IEEE Journal on Selected Areas in Communications.

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

[12]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[13]  Floris Geerts,et al.  MONDRIAN: Annotating and Querying Databases through Colors and Blocks , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[14]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[15]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[16]  Wang Chiew Tan Provenance in Databases: Past, Current, and Future , 2007, IEEE Data Eng. Bull..

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

[18]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[19]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[20]  Yan Gao,et al.  Optimizing File Retrieval in Delay-Tolerant Content Distribution Community , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.

[21]  Kang-Won Lee,et al.  RelayCast: Scalable multicast routing in Delay Tolerant Networks , 2008, 2008 IEEE International Conference on Network Protocols.

[22]  Jörg Ott,et al.  Redundancy and distributed caching in mobile DTNs , 2007, MobiArch '07.

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

[24]  Do Young Eun,et al.  Crossing over the bounded domain: from exponential to power-law inter-meeting time in MANET , 2007, MobiCom '07.

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

[26]  Divesh Srivastava,et al.  Intensional associations between data and metadata , 2007, SIGMOD '07.

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

[28]  Guohong Cao,et al.  Supporting Cooperative Caching in Disruption Tolerant Networks , 2011, 2011 31st International Conference on Distributed Computing Systems.

[29]  Mario Gerla,et al.  Scalable Multicast Routing in Delay Tolerant Networks , 2008 .

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