A DTN Routing Scheme for Quasi-Deterministic Networks with Application to LEO Satellites Topology

We propose a novel DTN routing algorithm, called DQN, specifically designed for quasi-deterministic networks with an application to satellite constellations. We demonstrate that our proposal efficiently forwards the information over a satellite network derived from the Orbcomm topology while keeping a low replication overhead. We compare our algorithm against other well-known DTN routing schemes and show that we obtain the lowest replication ratio without the knowledge of the topology and with a delivery ratio of the same order of magnitude than a reference theoretical optimal routing.

[1]  Paolo Giaccone,et al.  Optimal routing and scheduling for deterministic delay tolerant networks , 2009, 2009 Sixth International Conference on Wireless On-Demand Network Systems and Services.

[2]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[3]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM 2007.

[4]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[5]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[6]  Anders Lindgren,et al.  Probabilistic Routing Protocol for Intermittently Connected Networks , 2012, RFC.

[7]  Pan Hui,et al.  Promoting tolerance for delay tolerant network research , 2008, CCRV.

[8]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

[9]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[10]  Laurent Franck,et al.  Precomputed Routing in a Store and Forward Satellite Constellation , 2007, 2007 IEEE 66th Vehicular Technology Conference.

[11]  Michael A. Temple,et al.  An operational and performance overview of the IRIDIUM low earth orbit satellite system , 1999, IEEE Communications Surveys & Tutorials.

[12]  Marco Conti,et al.  Opportunistic networking: data forwarding in disconnected mobile ad hoc networks , 2006, IEEE Communications Magazine.

[13]  Scott Burleigh.  Contact Graph Routing , 2010 .

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

[15]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM '07.

[16]  R. Durst,et al.  Interplanetary internet (ipn): architectural definition , 2001 .

[17]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[18]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2011 .