Novel routing algorithms in space information networks based on timeliness-aware data mining and time-space graph

Abstract

Space information network is a kind of delay-tolerant networks. Recently, with possible participation of many network nodes, maintaining efficient and dynamic topology becomes crucial. In space information networks, the underlying topology is lack of continuous connectivity, and has the drawbacks of network segmentation, long delay and unreliable connections, which makes the routing design face severe challenges. In this paper, we propose novel routing schemes for space information networks. To construct a semi-deterministic time-space graph model, the timeliness-aware data mining algorithm is introduced to predict the contact probability for each pair of nodes. Using this time-space graph model, we put forward a simplified topology for achieving the reliable and cost-efficient routing. Simulation results demonstrate that the proposed routing algorithms can ensure the connectivity and reliability of paths over time, but also significantly reduce the total link overhead.