Inter-plane satellite matching in dense LEO constellations

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

Abstract

Dense constellations of Low Earth Orbit (LEO) small satellites are envisioned to make extensive use of the inter- satellite link (ISL). Within the same orbital plane, the inter- satellite distances are preserved and the links are rather stable. In contrast, the relative motion between planes makes the inter- plane ISL challenging. In a dense set-up, each spacecraft has several satellites in its coverage volume, but the time duration of each of these links is small and the maximum number of active connections is limited by the hardware. We analyze the matching problem of connecting satellites using the inter-plane ISL for unicast transmissions. We present and evaluate the performance of two solutions to the matching problem with any number of orbital planes and up to two transceivers: a heuristic solution with the aim of minimizing the total cost; and a Markovian solution to maintain the on-going connections as long as possible. The Markovian algorithm reduces the time needed to solve the matching up to 1000× and 10× with respect to the optimal solution and to the heuristic solution, respectively, without compromising the total cost. Our model includes power adaptation and optimizes the network energy consumption as the exemplary cost in the evaluations, but any other QoS-oriented KPI can be used instead.
Original languageEnglish
Title of host publicationProceedings of the IEEE Global Communications Conference (GLOBECOM) 2019
Number of pages6
Publication date2020
ISBN (Print)978-1-7281-0962-6
ISBN (Electronic)2576-6813
Publication statusPublished - 2020
EventIEEE Global Communications Conference (GLOBECOM) 2019 - Waikoloa, Hawaii, Waikoloa, United States
Duration: 9 Dec 201913 Dec 2019
https://globecom2019.ieee-globecom.org/

Conference

ConferenceIEEE Global Communications Conference (GLOBECOM) 2019
LocationWaikoloa, Hawaii
CountryUnited States
CityWaikoloa
Period09/12/201913/12/2019
Internet address

Fingerprint

Satellite links
Orbits
Earth (planet)
Satellites
Costs
Transceivers
Spacecraft
Quality of service
Energy utilization
Hardware

Cite this

Soret, B., Leyva-Mayorga, I., & Popovski, P. (2020). Inter-plane satellite matching in dense LEO constellations. In Proceedings of the IEEE Global Communications Conference (GLOBECOM) 2019
Soret, Beatriz ; Leyva-Mayorga, Israel ; Popovski, Petar. / Inter-plane satellite matching in dense LEO constellations. Proceedings of the IEEE Global Communications Conference (GLOBECOM) 2019. 2020.
@inproceedings{4a4b935006174faab685b7c9969cbc74,
title = "Inter-plane satellite matching in dense LEO constellations",
abstract = "Dense constellations of Low Earth Orbit (LEO) small satellites are envisioned to make extensive use of the inter- satellite link (ISL). Within the same orbital plane, the inter- satellite distances are preserved and the links are rather stable. In contrast, the relative motion between planes makes the inter- plane ISL challenging. In a dense set-up, each spacecraft has several satellites in its coverage volume, but the time duration of each of these links is small and the maximum number of active connections is limited by the hardware. We analyze the matching problem of connecting satellites using the inter-plane ISL for unicast transmissions. We present and evaluate the performance of two solutions to the matching problem with any number of orbital planes and up to two transceivers: a heuristic solution with the aim of minimizing the total cost; and a Markovian solution to maintain the on-going connections as long as possible. The Markovian algorithm reduces the time needed to solve the matching up to 1000× and 10× with respect to the optimal solution and to the heuristic solution, respectively, without compromising the total cost. Our model includes power adaptation and optimizes the network energy consumption as the exemplary cost in the evaluations, but any other QoS-oriented KPI can be used instead.",
author = "Beatriz Soret and Israel Leyva-Mayorga and Petar Popovski",
year = "2020",
language = "English",
isbn = "978-1-7281-0962-6",
booktitle = "Proceedings of the IEEE Global Communications Conference (GLOBECOM) 2019",

}

Soret, B, Leyva-Mayorga, I & Popovski, P 2020, Inter-plane satellite matching in dense LEO constellations. in Proceedings of the IEEE Global Communications Conference (GLOBECOM) 2019. IEEE Global Communications Conference (GLOBECOM) 2019, Waikoloa, United States, 09/12/2019.

Inter-plane satellite matching in dense LEO constellations. / Soret, Beatriz; Leyva-Mayorga, Israel; Popovski, Petar.

Proceedings of the IEEE Global Communications Conference (GLOBECOM) 2019. 2020.

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

TY - GEN

T1 - Inter-plane satellite matching in dense LEO constellations

AU - Soret, Beatriz

AU - Leyva-Mayorga, Israel

AU - Popovski, Petar

PY - 2020

Y1 - 2020

N2 - Dense constellations of Low Earth Orbit (LEO) small satellites are envisioned to make extensive use of the inter- satellite link (ISL). Within the same orbital plane, the inter- satellite distances are preserved and the links are rather stable. In contrast, the relative motion between planes makes the inter- plane ISL challenging. In a dense set-up, each spacecraft has several satellites in its coverage volume, but the time duration of each of these links is small and the maximum number of active connections is limited by the hardware. We analyze the matching problem of connecting satellites using the inter-plane ISL for unicast transmissions. We present and evaluate the performance of two solutions to the matching problem with any number of orbital planes and up to two transceivers: a heuristic solution with the aim of minimizing the total cost; and a Markovian solution to maintain the on-going connections as long as possible. The Markovian algorithm reduces the time needed to solve the matching up to 1000× and 10× with respect to the optimal solution and to the heuristic solution, respectively, without compromising the total cost. Our model includes power adaptation and optimizes the network energy consumption as the exemplary cost in the evaluations, but any other QoS-oriented KPI can be used instead.

AB - Dense constellations of Low Earth Orbit (LEO) small satellites are envisioned to make extensive use of the inter- satellite link (ISL). Within the same orbital plane, the inter- satellite distances are preserved and the links are rather stable. In contrast, the relative motion between planes makes the inter- plane ISL challenging. In a dense set-up, each spacecraft has several satellites in its coverage volume, but the time duration of each of these links is small and the maximum number of active connections is limited by the hardware. We analyze the matching problem of connecting satellites using the inter-plane ISL for unicast transmissions. We present and evaluate the performance of two solutions to the matching problem with any number of orbital planes and up to two transceivers: a heuristic solution with the aim of minimizing the total cost; and a Markovian solution to maintain the on-going connections as long as possible. The Markovian algorithm reduces the time needed to solve the matching up to 1000× and 10× with respect to the optimal solution and to the heuristic solution, respectively, without compromising the total cost. Our model includes power adaptation and optimizes the network energy consumption as the exemplary cost in the evaluations, but any other QoS-oriented KPI can be used instead.

M3 - Article in proceeding

SN - 978-1-7281-0962-6

BT - Proceedings of the IEEE Global Communications Conference (GLOBECOM) 2019

ER -

Soret B, Leyva-Mayorga I, Popovski P. Inter-plane satellite matching in dense LEO constellations. In Proceedings of the IEEE Global Communications Conference (GLOBECOM) 2019. 2020