# Dynamic Network Formation for FSO Satellite Communication
## 3 Minimum Spanning Tree on Dynamic Graphs (DMST)
### Discrete Dynamic Graphs \(Mst\)
Laser Beacon Tracking for Free-Space Optical Communication on Small-Satellite Platforms in Low-Earth Orbit. Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge, MA, USA, 2015. * (10) [PERSON]; [PERSON]; [PERSON] [PERSON] Abating Jamming in Free Space Optical Systems-A Game-theoretic Solution. _IEEE Trans. Commun._**2021**, _69_, 8375-8387. * (11) [PERSON]; [PERSON]; [PERSON]; [PERSON] [PERSON] Performance of optical space shift keying under jamming. _Appl. Opt._**2021**, _60_, 1856-1863. * (12) [PERSON]; [PERSON] [PERSON] Feedforward-based free-space optical communication. _Appl. Opt._**2021**, _60_, 3155-3161. [PubMed]
* (13) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Clustering Based Diversity Improving Transmit Laser Selection Schemes Using Quantized Feedback for FSO System. _IEEE Trans. Veh. Technol._**2021**, _70_, 6855-6868. * (14) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Spanning trees--Short or small. _SIAM J. Discret. Math._**1996**, \(9\), 178-200. * (15) [PERSON] Computers and intractability: A guide to the theory of NP-completeness ([PERSON] and [PERSON]). _Siam Rev._**1982**, _24_, 90. * (16) [PERSON]; [PERSON] Degree-constrained minimum spanning tree. _Comput. Oper. Res._**1980**, \(7\), 239-249. * (17) [PERSON] Topological design of centralized computer networks--Formulations and algorithms. _Networks_**1982**, _12_, 355-377. * (18) [PERSON] _An Effective Implementation of a GA Using a Direct Tree Representation for Constrained Minimum Spanning Tree Problems_; Technical Report 2000-2015. LaRIA; Universite de Picardie Jules Verne: Amiens, France, 2000. * (19) [PERSON]; [PERSON] A novel genetic algorithm for degree-constrained minimum spanning tree problem. _Int. J. Comput. Sci. Netw. Secur._**2006**, \(6\), 50-57. * (20) [PERSON]; [PERSON] Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem. _Eur. J. Oper. Res._**2008**, _191_, 677-690. * (21) [PERSON] [PERSON]; [PERSON]; [PERSON] [PERSON]; [PERSON] A hybrid algorithm based on tabu search and ant colony optimization for k-minimum spanning tree problems. _Expert Syst. Appl._**2012**, _39_, 5681-5686. * (22) [PERSON]; [PERSON]; [PERSON]; [PERSON] _Introduction to Algorithms_; MIT Press: Cambridge, MA, USA, 2009. * (23) [PERSON] Shortest connection networks and some generalizations. _Bell Syst. Tech. J._**1957**, _36_, 1389-1401. * (24) [PERSON] Delay is not an option: Low latency routing in space. In Proceedings of the 17 th ACM Workshop on Hot Topics in Networks, Redmond, WA, USA, 15-16 November 2018; pp. 85-91. * (25) [PERSON]; [PERSON]; [PERSON]; [PERSON] Directed percolation routing for ultra-reliable and low-latency services in low earth orbit (LEO) satellite networks. In Proceedings of the 2020 IEEE 92 nd Vehicular Technology Conference (VTC2020-Fall), Virtual Conference, 8 November-16 December 2020; pp. 1-6. * (26) [PERSON] Minimum bounded degree spanning trees. In Proceedings of the 2006 47 th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), Berkeley, CA, USA, 21-24 October 2006; pp. 273-282. * (27) [PERSON]; [PERSON] Approximating minimum bounded degree spanning trees to within one of optimal. _J. ACM_**2015**, _62_, 1-19. * (28) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] A network-flow technique for finding low-weight bounded-degree spanning trees. _J. Algorithms_**1997**, _24_, 310-324. * [PERSON] and [PERSON] (2012) [PERSON]; [PERSON], [PERSON] An Improved Ant-Based Algorithm for Minimum Degree Spanning Tree Problems. _JOSR J. Comput. Eng._**2012**, \(6\), 6-10. [CrossRef]
* [PERSON] et al. (2012) [PERSON]; [PERSON]; [PERSON] New heuristics for two bounded-degree spanning tree problems. _Inf. Sci._**2012**, _195_, 226-240. * [PERSON] et al. (2006) [PERSON]; [PERSON]; [PERSON] [PERSON] Ant colony optimization. _IEEE Comput. Intell. Mag._**2006**, \(1\), 28-39. * [PERSON] and [PERSON] (2021) [PERSON]; [PERSON], [PERSON]. 2014.