A caching-based approach to routing in delay-tolerant networks

Dan Henriksson, Tarek F. Abdelzaher, Raghu K. Ganti

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Delay-tolerant networks (DTNs), where no connected path generally exists between a source and a destination at any given time, present significant challenges from a routing perspective. A plethora of routing approaches have been previously introduced that make use of node mobility models or probabilistic models of network topology. In this paper, we offer a new perspective by making an analogy between routing table construction in DTNs and caching in program execution. In this approach, each node uses a simple caching heuristic to choose a subset of previously encountered nodes to be its routing neighbors. The approach is evaluated and shows good performance while keeping the implementation very simple.

Original languageEnglish (US)
Title of host publicationProceedings of 16th International Conference on Computer Communications and Networks 2007, ICCCN 2007
Pages69-74
Number of pages6
DOIs
StatePublished - 2007
Event16th International Conference on Computer Communications and Networks 2007, ICCCN 2007 - Honolulu, HI, United States
Duration: Aug 13 2007Aug 16 2007

Publication series

NameProceedings - International Conference on Computer Communications and Networks, ICCCN
ISSN (Print)1095-2055

Other

Other16th International Conference on Computer Communications and Networks 2007, ICCCN 2007
CountryUnited States
CityHonolulu, HI,
Period8/13/078/16/07

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'A caching-based approach to routing in delay-tolerant networks'. Together they form a unique fingerprint.

Cite this