Searching for content in mobile DTNs

Authors:
Mikko Pitkanen;Teemu Karkkainen;Janico Greifenberg;Jorg Ott
Affiliations:
Helsinki Institute of Physics, Technology Programme, Finland;Helsinki University of Technology, Department of Communications and Networking, Finland;Dampsoft GmbH, Germany;Helsinki University of Technology, Department of Communications and Networking, Finland
Venue:
PERCOM '09 Proceedings of the 2009 IEEE International Conference on Pervasive Computing and Communications
Year:
2009

Citing 0
Cited 7

DTN over aerial carriers

Proceedings of the 4th ACM workshop on Challenged networks
Opportunistic content sharing applications

Proceedings of the 1st ACM workshop on Emerging Name-Oriented Mobile Networking Design - Architecture, Algorithms, and Applications
Enabling ad-hoc-style communication in public WLAN hot-spots

Proceedings of the seventh ACM international workshop on Challenged networks
Seeker-assisted information search in mobile clouds

Proceedings of the second ACM SIGCOMM workshop on Mobile cloud computing
Enabling ad-hoc-style communication in public WLAN hot-spots

ACM SIGMOBILE Mobile Computing and Communications Review
Interest-based cloud-facilitated opportunistic networking

Proceedings of the 8th ACM MobiCom workshop on Challenged networks
Data to the people

Proceedings of the 8th ACM MobiCom workshop on Challenged networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.