A Space–Time Graph Based Multipath Routing in Disruption-Tolerant Earth-Observing Satellite Networks

In this paper, we consider the problem of routing in disruption-tolerant-networking-based earth-observing satellite networks, which are characterized by a frequently changing topology and potentially sparse and intermittent connectivity. To handle the routing challenges posed by these properties, we propose a joined space-temporal routing algorithmic framework for those networks, where the time-varying topology is modeled as a space–time graph leveraging the predictability of satellites’ relative motions. Based on this graph model, we devise a multipath routing algorithm [minimum-cost constrained multipath (MCMP)] to find a feasible set of available routing paths, through which a certain amount of mission data can be transferred back to ground stations within a tolerable delay with a minimum cost. To comparatively evaluate the performance of MCMP, moreover, we design an earliest arrival multipath routing policy (EAMP) algorithm based on the typical contact graph routing algorithm. The performance comparisons among MCMP, EAMP, and direct transfer strategy are simulated and analyzed.

[1]  Min Sheng,et al.  An Analytical Framework for Resource-Limited Small Satellite Networks , 2016, IEEE Communications Letters.

[2]  Yi Qian,et al.  Scoping Contact Graph-Routing Scalability: Investigating the System's Usability in Space-Vehicle Communication Networks , 2016, IEEE Vehicular Technology Magazine.

[3]  Scott Burleigh,et al.  Analysis of the contact graph routing algorithm: Bounding interplanetary paths , 2012 .

[4]  Hongyan Li,et al.  A routing policy based on time-varying graph for predictable delay tolerant networks , 2015, 2015 International Conference on Wireless Communications & Signal Processing (WCSP).

[5]  Chien-Chung Shen,et al.  Interrogation-based relay routing for ad hoc satellite networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

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

[7]  Stavros Toumpis,et al.  Optimal and achievable cost/delay tradeoffs in delay-tolerant networks , 2014, Comput. Networks.

[8]  Scott C. Burleigh,et al.  Bundle Protocol Specification , 2007, RFC.

[9]  Afonso Ferreira,et al.  Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs , 2010, Wirel. Networks.

[10]  Siyuan Chen,et al.  Reliable Topology Design in Time-Evolving Delay-Tolerant Networks with Unreliable Links , 2015, IEEE Trans. Mob. Comput..

[11]  Fotini-Niovi Pavlidou,et al.  Multiservice on-demand routing in LEO satellite networks , 2009, IEEE Transactions on Wireless Communications.

[12]  Carlo Caini,et al.  Application of Contact Graph Routing to LEO satellite DTN communications , 2012, 2012 IEEE International Conference on Communications (ICC).

[13]  Ram Ramanathan,et al.  Modeling and Analysis of Time-Varying Graphs , 2010, ArXiv.

[14]  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).

[15]  Peng Yuan,et al.  An event-driven graph-based min-cost delivery algorithm in earth observation DTN networks , 2015, 2015 International Conference on Wireless Communications & Signal Processing (WCSP).

[16]  Afonso Ferreira,et al.  Performance Evaluation of Dynamic Networks using an Evolving Graph Combinatorial Model , 2006, 2006 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications.

[17]  Wei Chen,et al.  Load Balancing Routing Based on Agent for Polar-orbit LEO Satellite Networks ⋆ , 2012 .

[18]  Afonso Ferreira,et al.  Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks , 2003, Int. J. Found. Comput. Sci..

[19]  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.

[20]  Donald F. Towsley,et al.  Benefits of Network Coding for Unicast Application in Disruption-Tolerant Networks , 2013, IEEE/ACM Transactions on Networking.

[21]  Ruhai Wang,et al.  Performance of bundle protocol for deep-space communications , 2016, IEEE Transactions on Aerospace and Electronic Systems.

[22]  Ruhai Wang,et al.  Modeling memory-variation dynamics for the Licklider transmission protocol in deep-space communications , 2015, IEEE Transactions on Aerospace and Electronic Systems.

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

[24]  Mostafa Ammar,et al.  Routing in Space and Time in Networks with Predictable Mobility , 2004 .

[25]  Hongyan Li,et al.  A buffer-limited maximum throughput routing algorithm for satellite network , 2015, 2015 22nd International Conference on Telecommunications (ICT).

[26]  Eylem Ekici,et al.  A distributed routing algorithm for datagram traffic in LEO satelitte networks , 2001, TNET.

[27]  Daniel C. Lee,et al.  Expected file-delivery time of deferred NAK ARQ in CCSDS file-delivery protocol , 2004, IEEE Transactions on Communications.

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