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

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.

[1]  Oliver Brock,et al.  MV routing and capacity building in disruption tolerant networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  Cecilia Mascolo,et al.  Adaptive routing for intermittently connected mobile ad hoc networks , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[3]  Li Li,et al.  Practical Routing in Delay-Tolerant Networks , 2007, IEEE Trans. Mob. Comput..

[4]  Sandy Irani,et al.  Cost-Aware WWW Proxy Caching Algorithms , 1997, USENIX Symposium on Internet Technologies and Systems.

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

[6]  Mario Gerla,et al.  Ad-hoc Storage Overlay System (ASOS): A Delay-Tolerant Approach in MANETs , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[7]  Paul A. S. Ward,et al.  Practical Routing in Delay-Tolerant Networks , 2005, IEEE Transactions on Mobile Computing.

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

[9]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[10]  Martin Arlitt,et al.  Enhancement and Validation of Squid's Cache Replacement Policy , 1999 .

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

[12]  James A. Davis,et al.  Wearable computers as packet transport mechanisms in highly-partitioned ad-hoc networks , 2001, Proceedings Fifth International Symposium on Wearable Computers.

[13]  J. T. Robinson,et al.  Data cache management using frequency-based replacement , 1990, SIGMETRICS '90.

[14]  S. Ghandeharizadeh,et al.  An evaluation of location-demographic replacement policies for zebroids , 2006, CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006..

[15]  Chen-Nee Chuah,et al.  Knowledge-based opportunistic forwarding in vehicular wireless ad hoc networks , 2005, 2005 IEEE 61st Vehicular Technology Conference.

[16]  Martin F. Arlitt,et al.  Evaluating content management techniques for Web proxy caches , 2000, PERV.

[17]  Ling-Jyh Chen,et al.  A hybrid routing approach for opportunistic networks , 2006, CHANTS '06.