Abstract
In this paper, the topology configuration methods for heterogeneous optical satellite networks are investigated. Our objectives are to maximize weighted algebraic connectivity with respect to both network initialization and reconfiguration scenarios subject to onboard hardware constraints. The problems are not strictly convex and have been proven as NP-hard. In order to solve the problems in polynomial time, the original problems are relaxed to a convex optimization problem. Specifically, the relaxed problem is transformed to a positive semidefinite programming form, which can be solved exactly and more efficiently. Furthermore, based on the perturbation theory of matrices, we propose two greedy heuristic methods to deal with the initialization and reconfiguration case from the relaxed solutions, respectively. Simulation results show that the proposed algorithms are able to accomplish network initialization and reconfiguration correctly in the overwhelming majority of situations. The final sub-optimal solutions can also be obtained under low computational complexity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.