Constructing Robust Spanning Trees in Distributed Optical Communication Satellite Networks

Optical communication satellite network (OCSN) has been considered as a superior solution to broadband applications of space-based information, since it has many advantages such as less power and higher data rate. However, frail link, limited number of optical transceivers and time- varying network topology deteriorate topology control of OCSN in bootstrapping and reconfiguring scenarios. In this paper, we investigate the problem of constructing robust spanning trees in distributed OCSNs. Larger algebraic connectivity represents better robustness for a spanning tree. Regarding the complexity of the problem, we develop a heuristic algorithm for achieving a spanning tree with large algebraic connectivity and high average edge weight, which represents the OCSN link availability in the graph. Simulation results indicate that, comparing with other alternative algorithms, our algorithm can significantly improve algebraic connectivity and guarantee relative high average edge weight for resulting topology.