N-Look Ahead Routing and Scheduling (N-LARS) for DTN Space Networks

Abstract

Humans’ deep space exploration missions have attracted great interest in the past decade. The Interplanetary Network (IPN), hence, has to undergo many structural changes, as the traffic loads and types will drastically increase. In this paper, we propose N-Look Ahead Routing and Scheduling (N-LARS), a novel scheduling and routing technique for DTN-based IPNs with these new challenges. Our N-LARS model for Delay Tolerant Networking (DTN)-based IPNs provides scheduling of bundles (also called requests or messages) and efficient routing across the overall network. We develop a mixed integer linear programming (MILP) formulation for N-LARS problem and solve it using CPLEX. We further derive a heuristic that scales better than the MILP for large networks. We run experiments on networks mimicking the proposed Mars project by the European Space Agency. Finally, we compare the performance of the network using our scheduling model to its performance using the usual routing technique such as the Contact Graph Routing (CGR). Our simulation results show that the overall performance of the network using N-LARS for bundle scheduling and routing is four times better than CGR, in terms of delivered bundles, and 13.8% closer to the sub- optimal schedule generated by the CPLEX solver.