Toward Autonomous Cooperation in Heterogeneous Nanosatellite Constellations Using Dynamic Graph Neural Networks (2403.00692v2)
Abstract: The upcoming landscape of Earth Observation missions will defined by networked heterogeneous nanosatellite constellations required to meet strict mission requirements, such as revisit times and spatial resolution. However, scheduling satellite communications in these satellite networks through efficiently creating a global satellite Contact Plan (CP) is a complex task, with current solutions requiring ground-based coordination or being limited by onboard computational resources. The paper proposes a novel approach to overcome these challenges by modeling the constellations and CP as dynamic networks and employing graph-based techniques. The proposed method utilizes a state-of-the-art dynamic graph neural network to evaluate the performance of a given CP and update it using a heuristic algorithm based on simulated annealing. The trained neural network can predict the network delay with a mean absolute error of 3.6 minutes. Simulation results show that the proposed method can successfully design a contact plan for large satellite networks, improving the delay by 29.1%, similar to a traditional approach, while performing the objective evaluations 20x faster.
- O. Kodheli, E. Lagunas, N. Maturo, S. K. Sharma, B. Shankar, J. F. M. Montoya, J. C. M. Duncan, D. Spano, S. Chatzinotas, S. Kisseleff, J. Querol, L. Lei, T. X. Vu, and G. Goussetis, “Satellite Communications in the New Space Era: A Survey and Future Challenges,” IEEE Communications Surveys & Tutorials, vol. 23, no. 1, pp. 70–109, 2021.
- Euroconsult, “Earth observation data & services market: A 360° view of the demand and supply related to the earth observation data and services market,” December 2022. 15th Edition.
- G. Curzi, D. Modenini, and P. Tortora, “Large Constellations of Small Satellites: A Survey of Near Future Challenges and Missions,” Aerospace, vol. 7, p. 133, Sept. 2020.
- K. Fall, “A delay-tolerant network architecture for challenged internets,” in Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM ’03, (New York, NY, USA), pp. 27–34, Association for Computing Machinery, Aug. 2003.
- C. Araguz, E. Bou-Balust, and E. Alarcón, “Applying autonomy to distributed satellite systems: Trends, challenges, and future prospects,” Systems Engineering, vol. 21, pp. 401–416, Sept. 2018.
- J. A. Fraire and J. M. Finochietto, “Design challenges in contact plans for disruption-tolerant satellite networks,” IEEE Communications Magazine, vol. 53, pp. 163–169, May 2015.
- Y. Wang, M. Sheng, J. Li, X. Wang, R. Liu, and D. Zhou, “Dynamic Contact Plan Design in Broadband Satellite Networks With Varying Contact Capacity,” IEEE Communications Letters, vol. 20, pp. 2410–2413, Dec. 2016.
- D. Zhou, M. Sheng, X. Wang, C. Xu, R. Liu, and J. Li, “Mission Aware Contact Plan Design in Resource-Limited Small Satellite Networks,” IEEE Transactions on Communications, vol. 65, pp. 2451–2466, June 2017.
- J. Fraire and J. M. Finochietto, “Routing-aware fair contact plan design for predictable delay tolerant networks,” Ad Hoc Networks, vol. 25, pp. 303–313, Feb. 2015.
- J. A. Fraire, P. G. Madoery, J. M. Finochietto, and G. Leguizamón, “An evolutionary approach towards contact plan design for disruption-tolerant satellite networks,” Applied Soft Computing, vol. 52, pp. 446–456, Mar. 2017.
- H. Yan, Q. Zhang, Y. Sun, and J. Guo, “Contact plan design for navigation satellite network based on simulated annealing,” in 2015 IEEE International Conference on Communication Software and Networks (ICCSN), pp. 12–16, June 2015.
- W. Shi, D. Gao, H. Zhou, B. Feng, H. Li, G. Li, and W. Quan, “Distributed contact plan design for multi-layer satellite-terrestrial network,” China Communications, vol. 15, pp. 23–34, Jan. 2018.
- J. Skarding, B. Gabrys, and K. Musial, “Foundations and modelling of dynamic networks using Dynamic Graph Neural Networks: A survey,” arXiv:2005.07496 [cs, stat], May 2020.
- J. Suarez-Varela, P. Almasan, M. Ferriol-Galmes, K. Rusek, F. Geyer, X. Cheng, X. Shi, S. Xiao, F. Scarselli, A. Cabellos-Aparicio, and P. Barlet-Ros, “Graph Neural Networks for Communication Networks: Context, Use Cases and Opportunities,” IEEE Network, pp. 1–8, 2022.
- D. Bertsimas and J. Tsitsiklis, “Simulated annealing,” Statistical science, vol. 8, no. 1, pp. 10–15, 1993.
- J. A. Fraire, O. De Jonckère, and S. C. Burleigh, “Routing in the Space Internet: A contact graph routing tutorial,” Journal of Network and Computer Applications, vol. 174, p. 102884, Jan. 2021.
- A. Pareja, G. Domeniconi, J. Chen, T. Ma, T. Suzumura, H. Kanezashi, T. Kaler, T. B. Schardl, and C. E. Leiserson, “EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs,” arXiv:1902.10191 [cs, stat], Nov. 2019.
- M. Wang, D. Zheng, Z. Ye, Q. Gan, M. Li, X. Song, J. Zhou, C. Ma, L. Yu, Y. Gai, et al., “Deep graph library: A graph-centric, highly-performant package for graph neural networks,” arXiv preprint arXiv:1909.01315, 2019.
- A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga, et al., “Pytorch: An imperative style, high-performance deep learning library,” Advances in neural information processing systems, vol. 32, 2019.