Efficient topology control for time-varying spacecraft networks with unreliable links

In spacecraft networks, the time-varying topology, intermittent connectivity, and unreliable links make management of the network challenging. Previous works mainly focus on information propagation or routing. However, with a large number of nodes in the future spacecraft networks, it is very crucial regarding how to make efficient network topology controls. In this article, we investigate the topology control problem in spacecraft networks where the time-varying topology can be predicted. We first develop a model that formalizes the time-varying spacecraft network topologies as a directed space–time graph. Compared with most existing static graph models, this model includes both temporal and spatial topology information. To capture the characteristics of practical network, links in our space–time graph model are weighted by cost, efficiency , and unreliability . The purpose of our topology control is to construct a sparse (low total cost) structure from the original topology such that (1) the topology is still connected over space–time graph; (2) the cost efficiency ratio of the topology is minimized; and (3) the unreliability parameter is lower than the required bound. We prove that such an optimization problem is NP-hard. Then, we provide five heuristic algorithms, which can significantly maintain low topology cost efficiency ratio while achieving high reliable connectivity. Finally, simulations have been conducted on random space networks and hybrid low earth orbit/geostationary earth orbit satellite-based sensor network. Simulation results demonstrate the efficiency of our model and topology control algorithms.