Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
By Topic

A Caching-Based Approach to Routing in Delay-Tolerant Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Henriksson, D. ; Univ. of Illinois at Urbana-Champaign, Urbana ; Abdelzaher, T.F. ; Ganti, R.K.

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.

Published in:

Computer Communications and Networks, 2007. ICCCN 2007. Proceedings of 16th International Conference on

Date of Conference:

13-16 Aug. 2007