Evaluating the Power of a DTN Link

A delay-tolerant network (DTN) is characterized by an intermittent topology where nodes and links may be down for long periods of time. This work evaluates whether it is more efficient to stop and resume bundle transmissions on the next contact opportunity after they become interrupted by an ending contact (preemptive model) than dropping the affected bundles (lossy model). Common intuition tells that the former model involves higher response times than the latter, but also fewer losses, so the optimal choice may not be immediately evident. For the analysis, stochastic models that describe the bundle transmission process over a DTN channel that is characterized by recurrent and random contact opportunities are formulated. Simulation results confirm the accuracy of the models. The study reveals the performance trade-offs between the two design choices and indicates that, contrary to expectations, the lossy model makes more efficient use of the channel than with preemption according to Kleinrock's power metric, which integrates throughput, delay, and loss. However, after considering retransmissions, preemption yields slightly higher power than the lossy approach. This work brings new insights into DTN performance and design choices.

[1]  Haitao Wu,et al.  LTP asynchronous accelerated retransmission strategy for deep space communications , 2016, 2016 IEEE International Conference on Wireless for Space and Extreme Environments (WiSEE).

[2]  Igor Bisio,et al.  Contact graph routing in DTN space networks: overview, enhancements and performance , 2015, IEEE Communications Magazine.

[3]  Yuan-da Cao,et al.  Delay modeling and analysis in DTN multicasting , 2009, 2009 ISECS International Colloquium on Computing, Communication, Control, and Management.

[4]  P. Maitreyi,et al.  Design of Binary Spray and wait protocol for intermittently connected mobile networks , 2017, 2017 IEEE 7th Annual Computing and Communication Workshop and Conference (CCWC).

[5]  Hancheng Lu,et al.  Performance improvement in DTNs by packet size optimization , 2015, IEEE Transactions on Aerospace and Electronic Systems.

[6]  Zexue Li,et al.  Queueing Analysis for Delay/Disruption Tolerant Networks with Random Link Interruptions , 2016, 2016 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData).

[7]  Marina Ruggieri,et al.  Contact Graph Routing enhancements for delay tolerant space communications , 2014, 2014 7th Advanced Satellite Multimedia Systems Conference and the 13th Signal Processing for Space Communications Workshop (ASMS/SPSC).

[8]  Cauligi S. Raghavendra,et al.  Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[9]  Vassilis Tsaoussidis,et al.  Packet size and DTN transport service: Evaluation on a DTN Testbed , 2010, International Congress on Ultra Modern Telecommunications and Control Systems.

[10]  Leonard Kleinrock,et al.  Power and deterministic rules of thumb for probabilistic problems in computer communications , 1979 .

[11]  Ruhai Wang,et al.  Performance modeling of licklider transmission protocol (LTP) in deep-space communication , 2015, IEEE Transactions on Aerospace and Electronic Systems.

[12]  Qinyu Zhang,et al.  Analytical characterization of licklider transmission protocol (LTP) in cislunar communications , 2014, IEEE Transactions on Aerospace and Electronic Systems.

[13]  Esther Jennings,et al.  Enhancing Contact Graph Routing for Delay Tolerant Space Networking , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[14]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[15]  Ricardo Lent,et al.  Analysis of the Block Delivery Time of the Licklider Transmission Protocol , 2019, IEEE Transactions on Communications.

[16]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[17]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.