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.

[1]  Shiwen Mao,et al.  Building robust spanning trees in free space optical networks , 2010, 2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE.

[2]  Georges Kaddoum,et al.  Optical Communication in Space: Challenges and Mitigation Techniques , 2017, IEEE Communications Surveys & Tutorials.

[3]  Shanghong Zhao,et al.  Topology control in self-organized optical satellite networks based on minimum weight spanning tree , 2017 .

[4]  Jason J. Molitierno,et al.  The algebraic connectivity of two trees connected by an edge of infinite weight , 2001 .

[5]  Siavash Vahdati Daneshmand,et al.  On Steiner trees and minimum spanning trees in hypergraphs , 2003, Oper. Res. Lett..

[6]  Shiwen Mao,et al.  An Reformulation-Linearization Technique-Based Approach to Joint Topology Design and Load Balancing in FSO Networks , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[7]  Fang Liu,et al.  Bootstrapping free-space optical networks , 2006, IEEE Journal on Selected Areas in Communications.

[8]  F. Heine,et al.  Optical inter-satellite communication operational , 2010, 2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE.

[9]  Mohd Nazri,et al.  Challenges to Inter-Satellite Communication System: A Review , 2016 .

[10]  David W. Corne,et al.  A new evolutionary approach to the degree-constrained minimum spanning tree problem , 1999, IEEE Trans. Evol. Comput..

[11]  David G. Mayer,et al.  EDSN: A Large Swarm of Advanced Yet Very Affordable, COTS-based NanoSats that Enable Multipoint Physics and Open Source Apps , 2012 .

[12]  A. Zeilinger,et al.  Free-Space Optical Quantum Key Distribution Using Intersatellite Links , 2003 .

[13]  Juhani Koski,et al.  Algorithm for Generating the Pareto Optimal Set of Multiobjective Nonlinear Mixed-Integer Optimization Problems , 2007 .

[14]  Bojan Mohar,et al.  Eigenvalues, diameter, and mean distance in graphs , 1991, Graphs Comb..

[15]  W. Liu,et al.  Utility of algebraic connectivity metric in topology design of survivable networks , 2009, 2009 7th International Workshop on Design of Reliable Communication Networks.

[16]  Tao Ding,et al.  Topology control algorithm and dynamic management scheme for mobile FSO networks , 2015, IEEE/OSA Journal of Optical Communications and Networking.

[17]  Fatih Alagöz,et al.  Energy Efficiency and Satellite Networking: A Holistic Overview , 2011, Proc. IEEE.

[18]  Vincent W. S. Chan.  Optical satellite networks , 2003, The 16th Annual Meeting of the IEEE Lasers and Electro-Optics Society, 2003. LEOS 2003..

[19]  Shanghong Zhao,et al.  Weighted Algebraic Connectivity Maximization for Optical Satellite Networks , 2017, IEEE Access.

[20]  Ting-yong Wu,et al.  Performance Analysis of the Inter-Layer Inter-Satellite Link Establishment Strategies in Two-tier LEO/MEO Satellite Networks: Performance Analysis of the Inter-Layer Inter-Satellite Link Establishment Strategies in Two-tier LEO/MEO Satellite Networks , 2011 .