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.

Guangyuan Wei

dblp:313/1463 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

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

Computer networks · 1 · 1 first-author · 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 · 67% Routing and switching · 33%

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

TopicWeightPapersLastEvidence papers
Routing and switching › routing
anycast routing
0.912025
Potential Field-Based and Network State-Aware Anycast Routing for LEO Satellite Networks · IEEE Trans. Commun. 2025
Vehicular, aerial and satellite networks › satellite networks
LEO satellite networks
0.912025
Potential Field-Based and Network State-Aware Anycast Routing for LEO Satellite Networks · IEEE Trans. Commun. 2025
Vehicular, aerial and satellite networks
satellite network routing
0.912025
Potential Field-Based and Network State-Aware Anycast Routing for LEO Satellite Networks · IEEE Trans. Commun. 2025

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

potential field theory · 0.9distributed routing · 0.9
YearPublicationVenuePosition
2025 Potential Field-Based and Network State-Aware Anycast Routing for LEO Satellite Networks
abstract
Low Earth Orbit Satellite Networks (LEOSNs) have emerged as a promising paradigm for space information networks, where multiple inter-satellite links facilitate the rapid transmission of on-orbit data to multi-ground station systems. When the destination of the transmission is not a certain ground station, but anyone of the ground stations, it can be modeled as an anycast problem. However, the time-varying topology, dynamic inter-satellite link status and limited onboard resources bring challenges to the routing of on-orbit data. Existing unicast routing solutions failed to address the anycast routing problem as they could not fully utilize multiple ground stations. Inspired by the Potential Field (PF) theory in physics, we make the first attempt to adopt the PF approach in the on-orbit data anycast routing problem. We design a synthesized PF model including several sub-fields corresponding to network states such as length of path, node transmission load and link bandwidth. By implementing inter-satellite propagation and synthesis of PF, dynamic perception and unified measurement of network states can be achieved. Based on our PF model, we propose a distributed PF-based and Network State-aware Anycast Routing (PFNSAR) algorithm, which regards the ground stations as multiple sources of attractive potential and guides packets along the gradient of synthesized PF. Meanwhile, the occurrence of the well-known local minimum is novelly handled by setting PF configuration subject to a parameter constraint and switching routing modes when routing packets. Extensive simulations demonstrate that PFNSAR provides unified assessment of multi-dimensional network states, reduces up to 30% of average delivery delay, and improves the performance including packet delivery rate and load balancing compared with existing works.
Guangyuan Wei, Yunpeng Hou, Shuangwu Chen, Jian Yang 0014, Huasen He, Feng Wu 0005
IEEE Trans. Commun.1