Link Handover-Aware Multicast Algorithms for LEO Satellite Networks

Low Earth orbit (LEO) satellite networks have emerged as an efficient solution to offer communications services worldwide, especially to remote areas uncovered by current terrestrial networks. A network with sufficient satellites deployed can connect any two points on the ground. However, routing for multicast requests is more challenging due to the inherent mobility of LEO satellites. This paper aims to design the shortest routes for multicast requests while reducing the number of link handovers. The formulated problem appears to be an NP-hard problem. We first propose a low-complexity heuristic algorithm, the Minimum Handover Tree (MHT) algorithm, to find a suboptimal solution efficiently. We then further design a Multicast Tree Size Aware Handover (MTSAH) algorithm to improve the MHT algorithm in the tree size. The simulation results demonstrate that our proposed solutions outperform several baselines in the existing work.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/icc52391.2025.11161779
Primary Topic
Satellite Communication Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Link Handover-Aware Multicast Algorithms for LEO Satellite Networks

Nguyen Van Cuong, An‐Chou Yeh, Y.C. Lin, Jang‐Ping Sheu
Satellite Communication Systems
article

Link Handover-Aware Multicast Algorithms for LEO Satellite Networks

Nguyen Van Cuong, An‐Chou Yeh, Y.C. Lin, Jang‐Ping Sheu
article en

Abstract

Low Earth orbit (LEO) satellite networks have emerged as an efficient solution to offer communications services worldwide, especially to remote areas uncovered by current terrestrial networks. A network with sufficient satellites deployed can connect any two points on the ground. However, routing for multicast requests is more challenging due to the inherent mobility of LEO satellites. This paper aims to design the shortest routes for multicast requests while reducing the number of link handovers. The formulated problem appears to be an NP-hard problem. We first propose a low-complexity heuristic algorithm, the Minimum Handover Tree (MHT) algorithm, to find a suboptimal solution efficiently. We then further design a Multicast Tree Size Aware Handover (MTSAH) algorithm to improve the MHT algorithm in the tree size. The simulation results demonstrate that our proposed solutions outperform several baselines in the existing work.

National Tsing Hua University (TW)
Openalex Percentile: Top 65%
Satellite Communication Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Link Handover-Aware Multicast Algorithms for LEO Satellite Networks — Nguyen Van Cuong, An‐Chou Yeh, et al. · (2025) | TGRS Research Map | TGRS