A Resource Allocation Scheme in Heterogeneous Multi-system Satellite Network with Beam-hopping
Bibliographic record
Abstract
The emerging architecture in the next generation of mobile networks leverages the coexistence of Low Earth Orbit (LEO) and Geostationary Orbit (GEO) satellites in a heterogeneous network. This setup not only offers seamless coverage but also enhances user rates. Nevertheless, the efficient allocation of onboard resources, particularly spectrum resources, poses a significant challenge due to their scarcity in such heterogeneous satellite coexistence networks. A practical solution is found in the use of beam hopping (BH) technology. This technology enables multi-beam satellites to serve users using fewer beams than traditional spot-beam systems. This paper proposes a resource allocation strategy for the heterogeneous LEO-GEO coexistence satellite network. We formulate this resource allocation strategy as a joint optimization problem. Due to the complexity of the system arising from the coupling of multiple variables, we break down the original problem into two manageable sub-problems. The first addresses user association, subcarrier, and power allocation and employs a standard convex optimization algorithm for a solution. The second tackles the illuminated beam selection issue, with a genetic algorithm (GA) providing a solution. The effectiveness of our proposed scheme is established through simulation experiments, demonstrating clear performance gains.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".