Fully-Decoupled Radio Access Networks: A Resilient Uplink Base Stations Cooperative Reception Framework
Bibliographic record
Abstract
To cope with the even more urgent spectrum and energy efficiency challenge for trillion-level terminal access and data uploading in the next generation mobile communication network (6G), in this paper, we investigate the uplink transmission in an original fully-decoupled radio access networks (FD-RAN) architecture. Specifically, we propose a resilient uplink base station cooperative reception framework in FD-RAN, which is a large-scale fading based two-tier signal combination approach for the uplink transmission, including the localized signal combination at the base station and centralized signal combination at the edge cloud, respectively. Then, we formulate a weighted sum-rate maximization problem for the uplink transmission optimization, and decompose it into two subproblems. A spectrum-efficiency maximized virtual service cluster selection (SEMVS) algorithm is designed by leveraging the channel statistical information for solving subproblem one, and a fractional programming based power control (FPPC) algorithm is introduced for the power optimization of subproblem two. Compared to the typical RAN architectures with corresponding access and power control methods, simulation results demonstrate the significant performance improvements of uplink FD-RAN with the proposed solution.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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 source (direct Gemma or distilled Codex), 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".