A Source Routing Algorithm Based on CGR for DTN-Nanosatellite Networks

The number of nanosatellites orbiting around the Earth is increasing year after year. Nanosatellite constellations can be deployed to cover even larger areas. However, data exchange among nanosatellites is not trivial, especially due to the required hardware components related to the limited size and weight. Moreover, in some cases, contacts between nanosatellites and ground stations cannot always be guaranteed. The Delay and Disruption Tolerant Networking (DTN) paradigm allows storing data in nanosatellite and ground station buffers until the contact with the next hop is available. Routing in this kind of network is a crucial aspect. Delivery times are larger compared to a \u201cclassical\u201d network due to the time that data have to wait inside intermediate node buffers and to the limitation of available resources, especially on-board nanosatellites. The adoption of a smart routing strategy can contribute relieving this gap. In this paper, we propose S-CGR, a Source routing algorithm based on the Contact Graph Routing (CGR). It computes a routing path from source to destination nodes for each bundle, which is the data unit in DTN networks. S-CGR considers static and known a priori information about contacts (begin times, end times, and overall contact volumes) and dynamic information about nanosatellite buffer occupancies and available contact volumes. The complete source/destination paths are stored in the bundles. Intermediate nodes read the routin