Performance Evaluation of Content-Based Information Retrieval Schemes for DTNs

Mobile nodes in some challenging network scenarios suffer from intermittent connectivity and frequent partitions e.g. battlefield and disaster recovery scenarios. Disruption Tolerant Network (DTN) technologies are designed to enable nodes in such environments to communicate with one another. Several DTN routing schemes have been proposed. However, not much work has been done on providing information access in such challenging network scenarios. Existing client/server paradigm for information access will not be feasible in such scenarios since end-to-end path does not exist. Thus, in this paper, we explore how a content-based information retrieval system can be designed for DTNs. There are three important design issues, namely (a) how should data be replicated and stored at multiple nodes, (b) how should a query be disseminated in sparsely connected networks, (c) how should a query response be routed back to the querying node. We first describe two data caching schemes: (a) K-copy random caching, (b) K-copy intelligent caching. Then, we describe an L-hop Neighborhood Spraying (LNS) scheme for query dissemination. For message routing, we either use Prophet routing scheme or Highest Encounter First Routing (HEFR) scheme. We conduct extensive simulation studies to evaluate different combinations of these algorithms. Our results reveal that the scheme that performs the best is the one that uses the K-copy intelligent caching combined with the LNS query dissemination and HEFR scheme.

[1]  Vinton G. Cerf,et al.  Delay-Tolerant Networking Architecture , 2007, RFC.

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

[3]  Takahiro Hara,et al.  Effective replica allocation in ad hoc networks for improving data accessibility , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[4]  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).

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

[6]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

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

[8]  Bo Sheng,et al.  Data storage placement in sensor networks , 2006, MobiHoc '06.

[9]  Margaret Martonosi,et al.  Erasure-coding based routing for opportunistic networks , 2005, WDTN '05.

[10]  P. Yang,et al.  Node Density-Based Adaptive Routing Scheme for Disruption Tolerant Networks , 2006, MILCOM 2006 - 2006 IEEE Military Communications conference.

[11]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[12]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

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

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

[15]  Shudong Jin,et al.  Content and service replication strategies in multi-hop wireless mesh networks , 2005, MSWiM '05.

[16]  Ellen W. Zegura,et al.  Message ferry route design for sparse ad hoc networks with mobile nodes , 2006, MobiHoc '06.