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

Zanyang Dong

dblp:238/2756 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0002-6174-6709ORCID · reported

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

Computer 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 · 50% Network optimization and economics · 50%
Theoretical computer science
1 paper
Mathematical optimization · 100%
Artificial intelligence
1 paper
Reinforcement learning · 100%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics
resource allocation
0.912025
Frequency Plan Design and Beam Power Allocation for Flexible High Throughput Satellite Systems: A Two-Stage Optimization Framework · IEEE Trans. Commun. 2025
Vehicular, aerial and satellite networks
satellite communication
0.912025
Frequency Plan Design and Beam Power Allocation for Flexible High Throughput Satellite Systems: A Two-Stage Optimization Framework · IEEE Trans. Commun. 2025
Mathematical optimization › integer programming › mixed-integer optimization
mixed-integer nonlinear programming
0.912025
Frequency Plan Design and Beam Power Allocation for Flexible High Throughput Satellite Systems: A Two-Stage Optimization Framework · IEEE Trans. Commun. 2025
Machine learning › Reinforcement learning
multi-agent reinforcement learning
0.312025
Frequency Plan Design and Beam Power Allocation for Flexible High Throughput Satellite Systems: A Two-Stage Optimization Framework · IEEE Trans. Commun. 2025

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

proximal policy optimization · 2.6multi-agent deep reinforcement learning · 2.6difference of convex programming · 2.6
YearPublicationVenuePosition
2025 Frequency Plan Design and Beam Power Allocation for Flexible High Throughput Satellite Systems: A Two-Stage Optimization Framework
abstract
With the continuous advancement of onboard digital payload technology, high-throughput satellites (HTSs) now possess the capability to dynamically reconfigure their onboard resources in response to user traffic demands. This flexibility is primarily enabled by the efficient design of the satellite’s frequency plan and the beam power allocation scheme. However, the joint optimization of frequency planning and power allocation is a typical mixed-integer nonlinear programming (MINLP) problem, which can not be directly solved using traditional optimization methods. To address this issue, we propose a two-stage optimization framework, aimed at bridging the gap between the beam capacity and the user traffic request, while simultaneously avoiding co-channel interference among different beams. In the first stage, we propose a multi-agent deep reinforcement learning framework based on proximal policy optimization. By modeling each beam as an agent, each beam can select its reuse group, starting frequency, bandwidth, and transmit power based on the current system state. To mitigate the impact of neural network randomness on the results, we further introduce a second-stage optimization algorithm using the difference of convex (DC) programming to refine the beam power allocation. Simulation results demonstrate that the proposed algorithm significantly reduces execution time compared to benchmark algorithms, such as genetic algorithms and particle swarm optimization, while also demonstrating considerable performance improvements.
Zanyang Dong, Yejun Zhou, Shuai Han 0002
IEEE Trans. Commun.3