journal article·2022-01-12Open access

Dynamic Network Formation for FSO Satellite Communication

Revital Marbel, Roi Yozevitch, Tal Grinshpoun, Boaz Ben-Moshe

Applied Sciences· Volume 12· Issue 2

Abstract

Satellite network optimization is essential, particularly since the cost of manufacturing, launching and maintaining each satellite is significant. Moreover, classical communication optimization methods, such as Minimal Spanning Tree, cannot be applied directly in dynamic scenarios where the satellite constellation is constantly changing. Motivated by the rapid growth of the Star-Link constellation that, as of Q4 2021, consists of over 1600 operational LEO satellites with thousands more expected in the coming years, this paper focuses on the problem of constructing an optimal inter-satellite (laser) communication network. More formally, given a large set of LEO satellites, each equipped with a fixed number of laser links, we direct each laser module on each satellite such that the underlying laser network will be optimal with respect to a given objective function and communication demand. In this work, we present a novel heuristic to create an optimal dynamic optical network communication using an Ant Colony algorithm. This method takes into account both the time it takes to establish an optical link (acquisition time) and the bounded number of communication links, as each satellite has a fixed amount of optical communication modules installed. Based on a large number of simulations, we conclude that, although the underlying problem of bounded-degree-spanning-tree is NP-hard (even for static cases), the suggested ant-colony heuristic is able to compute cost-efficient solutions in semi-real-time.
Source: crossref · Quality: baseline

Research context

OpenAlex topics: Satellite Communication Systems · Optical Wireless Communication Technologies · Advanced Optical Network Technologies

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

Ariel Cyber Innovation Center and Astrophysics, Geophysics & Space Science Research Center, Department of Computer Science, Ariel University, Ariel 4070000, Israel

Department of Computer Science, Holon Institute of Technology, Holon 5810201, Israel

Ariel Cyber Innovation Center, Department of Industrial Engineering & Management, Ariel University, Ariel 4070000, Israel

References (35)

Show source-provided references
1. Google project loon
2. Gupta, O., and Fish, C. (2010). Iridium NEXT: A Global Access for Your Sensor Needs, American Geophysical Union. AGU Fall Meeting Abstracts.
3. Toyoshima, M. (2019, January 14–16). Recent Trends in Space Laser Communications for Small Satellites and Constellations. Proceedings of the 2019 IEEE International Conference on Space Optical Systems and Applications (ICSOS), Portland, OR, USA.10.1109/ICSOS45490.2019.8978972 ↗
4. Tang, Z., Li, S., Deng, W., Wang, Y., and Yu, W. (2019, January 19–20). Optimization of Satellite-Ground Coverage for Space-Ground Integrated Networks Based on Discrete Global Grids. Proceedings of the International Conference on Space Information Network, Wuzhen, China.10.1007/978-981-15-3442-3_11 ↗
5. Urban Free-Space Optical Network Optimization10.3390/app10217872 ↗
6. On the performance of dual-hop mixed RF/FSO wireless communication system in urban area over aggregated exponentiated Weibull fading channels with pointing errors10.1016/j.optcom.2017.10.062 ↗
7. Cornwell, D.M. (2017, January 14–16). NASA’s optical communications program for 2017 and beyond. Proceedings of the 2017 IEEE International Conference on Space Optical Systems and Applications (ICSOS), Naha, Japan.10.1109/ICSOS.2017.8357203 ↗
8. Boroson, D.M., Scozzafava, J.J., Murphy, D.V., Robinson, B.S., and Lincoln, M. (2009, January 19–23). The lunar laser communications demonstration (LLCD). Proceedings of the 2009 Third IEEE International Conference on Space Mission Challenges for Information Technology, Pasadena, CA, USA.10.1109/SMC-IT.2009.57 ↗
9. Nguyen, T.N.T. (2015). Laser Beacon Tracking for Free-Space Optical Communication on Small-Satellite Platforms in Low-Earth Orbit. [Ph.D. Thesis, Massachusetts Institute of Technology].
10. Abating Jamming in Free Space Optical Systems–A Game-theoretic Solution10.1109/TCOMM.2021.3109941 ↗
11. Performance of optical space shift keying under jamming10.1364/AO.414456 ↗
12. Feedforward-based free-space optical communication10.1364/AO.419288 ↗
13. Clustering Based Diversity Improving Transmit Laser Selection Schemes Using Quantized Feedback for FSO System10.1109/TVT.2021.3085308 ↗
14. Spanning trees—Short or small10.1137/S0895480194266331 ↗
15. Computers and intractability: A guide to the theory of NP-completeness (michael r. garey and david s. johnson)10.1137/1024022 ↗
16. Degree-constrained minimum spanning tree10.1016/0305-0548(80)90022-2 ↗
17. Topological design of centralized computer networks—Formulations and algorithms10.1002/net.3230120402 ↗
18. Li, Y. (2000). An Effective Implementation of a GA Using a Direct Tree Representation for Constrained Minimum Spanning Tree Problems, Universit e de Picardie Jules Verne. Technical Report, Technical Report 2000–2015, LaRIA.
19. A novel genetic algorithm for degree-constrained minimum spanning tree problem
20. Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem10.1016/j.ejor.2006.12.061 ↗
21. A hybrid algorithm based on tabu search and ant colony optimization for k-minimum spanning tree problems10.1016/j.eswa.2011.11.103 ↗
22. Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C. (2009). Introduction to Algorithms, MIT Press.
23. Shortest connection networks and some generalizations10.1002/j.1538-7305.1957.tb01515.x ↗
24. Handley, M. (2018, January 15–16). Delay is not an option: Low latency routing in space. Proceedings of the 17th ACM Workshop on Hot Topics in Networks, Redmond, WA, USA.10.1145/3286062.3286075 ↗
25. Hu, J., Cai, L., Zhao, C., and Pan, J. (December, January 8). Directed percolation routing for ultra-reliable and low-latency services in low earth orbit (LEO) satellite networks. Proceedings of the 2020 IEEE 92nd Vehicular Technology Conference (VTC2020-Fall), Virtual Conference.10.1109/VTC2020-Fall49728.2020.9348676 ↗
26. Goemans, M.X. (2006, January 21–24). Minimum bounded degree spanning trees. Proceedings of the 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS’06), Berkeley, CA, USA.10.1109/FOCS.2006.48 ↗
27. Approximating minimum bounded degree spanning trees to within one of optimal10.1145/2629366 ↗
28. A network-flow technique for finding low-weight bounded-degree spanning trees10.1006/jagm.1997.0862 ↗
29. An Improved Ant-Based Algorithm for Minimum Degree Spanning Tree Problems10.9790/0661-0640610 ↗
30. New heuristics for two bounded-degree spanning tree problems10.1016/j.ins.2012.01.037 ↗
31. Ant colony optimization10.1109/MCI.2006.329691 ↗
32. Hagberg, A., and Pieter Swart, D.S. (2021, October 24). Nentworkx. Available online: https://networkx.org/.
33. Rhodes, B.C. (2021, October 24). PyEphem Astronomy Library. Available online: https://rhodesmill.org/pyephem/.
34. Analysis of Inter-Satellite Link Paths for LEO Mega-Constellation Networks10.1109/TVT.2021.3058126 ↗
35. Lai, Z., Li, H., and Li, J. (2020, January 13–16). StarPerf: Characterizing Network Performance for Emerging Mega-Constellations. Proceedings of the 2020 IEEE 28th International Conference on Network Protocols (ICNP), Madrid, Spain.10.1109/ICNP49622.2020.9259357 ↗