Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Handong Luo

dblp:372/2756 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0006-0091-0540ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Vehicular, aerial and satellite networks · 62% Routing and switching · 19% Network optimization and economics · 19%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Vehicular, aerial and satellite networks
satellite networks
0.912025
Efficient Satellite-Ground Interconnection Design for Low-Orbit Mega-Constellation Topology · IEEE Trans. Mob. Comput. 2025
Network optimization and economics
latency optimization
0.312025
Efficient Satellite-Ground Interconnection Design for Low-Orbit Mega-Constellation Topology · IEEE Trans. Mob. Comput. 2025
Routing and switching
routing
0.312025
Efficient Satellite-Ground Interconnection Design for Low-Orbit Mega-Constellation Topology · IEEE Trans. Mob. Comput. 2025

Methods — techniques the papers use, named apart from their topics

simulation · 0.9classification-based longest remaining service time · 0.9
YearPublicationVenuePosition
2025 Efficient Satellite-Ground Interconnection Design for Low-Orbit Mega-Constellation Topology
abstract
The low-orbit mega-constellation network (LMCN) is an important part of the space-air-ground integrated network system. An effective satellite-ground interconnection design can result in a stable constellation topology for LMCNs. A naïve solution is accessing the satellite with the longest remaining service time (LRST), which is widely used in previous designs. The Coordinated Satellite-Ground Interconnecting (CSGI), the state-of-the-art algorithm, coordinates the establishment of ground-satellite links (GSLs). Compared with existing solutions, it reduces latency by 19% and jitter by 70% on average. However, CSGI only supports the scenario where terminals access only one satellite, and cannot fully utilize the multi-access capabilities of terminals. Additionally, CSGI's high computational complexity poses deployment challenges. To overcome these problems, we propose the Classification-based Longest Remaining Service Time (C-LRST) algorithm. C-LRST supports the actual scenario with multi-access capabilities. It adds optional paths during routing with low computational complexity, improving end-to-end communications quality. We conduct our 1000 s simulation from Brazil to Lithuania on the open-source platform Hypatia. Experiment results show that compared with CSGI, C-LRST reduces the latency and increases the throughput by approximately 60% and 40%, respectively. In addition, C-LRST's GSL switchings number is 14, whereas CSGI is 23. C-LRST has better link stability than CSGI.
Jiazhi Wu, Quanwei Lin, Handong Luo, Qi Zhang 0013, Kun Qiu 0002, Zhe Chen 0015, Yue Gao 0001
IEEE Trans. Mob. Comput.4
2024 Hurry: Dynamic Collaborative Framework For Low-Orbit Mega-Constellation Data Downloading
Handong Luo, Qi Zhang 0013, Quanwei Lin, Kun Qiu 0002, Zhe Chen 0015, Yue Gao 0001
Euro-Par (1)1