Computing-Aware Routing Method Based on Node Expansion for DTN Space Networks

The enhanced processing capability of on-board processors has given spacecrafts the ability to process data, avoiding transmitting large volume of raw data to the ground. Proper computing strategy can lead to better utilization of the computing resources in space networks. This paper proposes a node expansion-based computing-aware routing algorithm (NECAR) to appropriate schedule computing tasks, in order to optimize the overall delay of transmission and processing. This algorithm integrates the determination of optimal transmission path and the selection of computing locations in the path. By extending one actual node into multiple virtual nodes, the NE-CAR transforms the computing-aware routing problem in Delay/Disruption-Tolerant networking (DTN) space networks into a regular routing problem. The experimental results show that use the computing strategy acquired by the NE-CAR can significantly reduce the time to obtain valid data compared to performing all data processing at a fixed location. Furthermore, the NE-CAR holds a much lower computational complexity compared with LP-based computing routing algorithms.