Searching for content in mobile DTNs

Delay-tolerant Networking (DTN) provides a platform for applications in environments where end-to-end paths may be highly unreliable or do not exist at all. In many applications such as distributed wikis or photo sharing, users need to be able to find content even when they do not know an unambiguous identifier. In order do bring these applications to the domain of DTNs, a search scheme is required that works despite the unreliable network conditions. In this paper, we introduce a search scheme that makes no assumptions about the underlying routing protocols and the format of search requests. We evaluate different algorithms for forwarding and terminating search queries, using simulations with different classes of DTN routing protocols for different mobility scenarios.

[1]  Amanda Spink,et al.  Real life information retrieval: a study of user queries on the Web , 1998, SIGF.

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

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

[4]  Arun Venkataramani,et al.  Web search from a bus , 2007, CHANTS '07.

[5]  Pan Hui,et al.  Osmosis in Pocket Switched Networks , 2006, 2006 First International Conference on Communications and Networking in China.

[6]  Amanda Spink,et al.  Model for organizational knowledge creation and strategic use of information: Research Articles , 2005 .

[7]  J. Ott,et al.  Increasing Reality for DTN Protocol Simulations , 2007 .

[8]  Jörg Ott,et al.  DTN-based Content Storage and Retrieval , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[9]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Shumeet Baluja,et al.  A large scale study of wireless search behavior: Google mobile search , 2006, CHI.

[11]  Gunnar Karlsson,et al.  Delay-Tolerant Broadcasting , 2006, IEEE Transactions on Broadcasting.

[12]  Amanda Spink,et al.  A temporal comparison of AltaVista Web searching , 2005, J. Assoc. Inf. Sci. Technol..

[13]  Scott C. Burleigh,et al.  Bundle Protocol Specification , 2007, RFC.

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

[15]  Bo Yang,et al.  Content-aware search of multimedia data in ad hoc networks , 2005, MSWiM '05.

[16]  Barry Smyth,et al.  Mobile information access: A study of emerging search behavior on the mobile Internet , 2007, TWEB.

[17]  Rabin Patra,et al.  Routing in Delay Tolerant Networks , 2003, SIGCOMM 2003.

[18]  Jörg Ott,et al.  Working day movement model , 2008, MobilityModels '08.

[19]  Monika Henzinger,et al.  Analysis of a very large web search engine query log , 1999, SIGF.

[20]  Susan Flynn Symington,et al.  Delay-Tolerant Networking Metadata Extension Block , 2011, RFC.

[21]  Anders Lindgren,et al.  Opportunistic content distribution in an urban setting , 2006, CHANTS '06.

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

[23]  Jussi Kangasharju,et al.  Explaining BubbleStorm: Resilient, Probabilistic, and Exhaustive PeertoPeer Search , 2007, SIGCOMM 2007.

[24]  Chen Avin,et al.  Efficient and robust query processing in dynamic environments using random walk techniques , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[25]  Sergio D. Servetto,et al.  Constrained random walks on random graphs: routing algorithms for large scale wireless sensor networks , 2002, WSNA '02.

[26]  Mingyan Liu,et al.  Controlled Flooding Search in a Large Network , 2007, IEEE/ACM Transactions on Networking.