Weighted Algebraic Connectivity Maximization for Optical Satellite Networks
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 probl...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2017-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/7911178/ |
| _version_ | 1831521623213080576 |
|---|---|
| author | Yongxing Zheng Shanghong Zhao Yun Liu Yongjun Li Qinggui Tan Ning Xin |
| author_facet | Yongxing Zheng Shanghong Zhao Yun Liu Yongjun Li Qinggui Tan Ning Xin |
| author_sort | Yongxing Zheng |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-13T23:28:28Z |
| format | Article |
| id | doaj.art-d60f2c0f037f45b291df7dd69aa55eba |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-13T23:28:28Z |
| publishDate | 2017-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-d60f2c0f037f45b291df7dd69aa55eba2022-12-21T23:27:29ZengIEEEIEEE Access2169-35362017-01-0156885689310.1109/ACCESS.2017.26978187911178Weighted Algebraic Connectivity Maximization for Optical Satellite NetworksYongxing Zheng0https://orcid.org/0000-0002-0913-9792Shanghong Zhao1Yun Liu2Yongjun Li3Qinggui Tan4Ning Xin5Information and Navigation College, Air Force Engineering University, Xi'an, ChinaInformation and Navigation College, Air Force Engineering University, Xi'an, ChinaInformation and Navigation College, Air Force Engineering University, Xi'an, ChinaInformation and Navigation College, Air Force Engineering University, Xi'an, ChinaNational Key Laboratory of Science and Technology on Space Microwave, Xi'an, ChinaInstitute of Telecommunication Satellite, China Academy of Space Technology, Beijing, ChinaIn 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.https://ieeexplore.ieee.org/document/7911178/Optical satellite networksweighted algebraic connectivityconvex optimizationgreedy heuristicmatrix perturbation |
| spellingShingle | Yongxing Zheng Shanghong Zhao Yun Liu Yongjun Li Qinggui Tan Ning Xin Weighted Algebraic Connectivity Maximization for Optical Satellite Networks IEEE Access Optical satellite networks weighted algebraic connectivity convex optimization greedy heuristic matrix perturbation |
| title | Weighted Algebraic Connectivity Maximization for Optical Satellite Networks |
| title_full | Weighted Algebraic Connectivity Maximization for Optical Satellite Networks |
| title_fullStr | Weighted Algebraic Connectivity Maximization for Optical Satellite Networks |
| title_full_unstemmed | Weighted Algebraic Connectivity Maximization for Optical Satellite Networks |
| title_short | Weighted Algebraic Connectivity Maximization for Optical Satellite Networks |
| title_sort | weighted algebraic connectivity maximization for optical satellite networks |
| topic | Optical satellite networks weighted algebraic connectivity convex optimization greedy heuristic matrix perturbation |
| url | https://ieeexplore.ieee.org/document/7911178/ |
| work_keys_str_mv | AT yongxingzheng weightedalgebraicconnectivitymaximizationforopticalsatellitenetworks AT shanghongzhao weightedalgebraicconnectivitymaximizationforopticalsatellitenetworks AT yunliu weightedalgebraicconnectivitymaximizationforopticalsatellitenetworks AT yongjunli weightedalgebraicconnectivitymaximizationforopticalsatellitenetworks AT qingguitan weightedalgebraicconnectivitymaximizationforopticalsatellitenetworks AT ningxin weightedalgebraicconnectivitymaximizationforopticalsatellitenetworks |