Resource Allocation in Cooperative Mid-Band/THz Networks in the Presence of Mobility
Bibliographic record
Abstract
This paper develops a comprehensive framework to investigate and optimize the downlink performance of cooperative <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">multi-band networks (MBNs)</i> operating on upper mid-band (UMB) and terahertz (THz) frequencies, where base stations (BSs) in each band cooperatively serve users. The framework captures sophisticated features such as near-field channel modeling, fully and partially connected antenna architectures, and users’ mobility. First, we consider joint user association and hybrid beamforming optimization to maximize the system sum-rate, subject to power constraints, maximum cluster size of cooperating BSs, and users’ quality-of-service (QoS) constraints. By leveraging fractional programming FP and majorization-minimization techniques, an iterative algorithm is proposed to solve the non-convex optimization problem. We then consider handover (HO)-aware resource allocation for <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">moving</i> users in a cooperative UMB/THz MBN. Two HO-aware resource allocation methods are proposed. The first method focuses on maximizing the HO-aware system sum-rate subject to HO-aware QoS constraints. Using Jensen’s inequality and properties of logarithmic functions, the non-convex optimization problem is tightly approximated with a convex one and solved. The second method addresses a multi-objective optimization problem to maximize the system sum-rate, while minimizing the total number of HOs. Numerical results demonstrate the efficacy of the proposed algorithms, cooperative UMB/THz MBN over stand-alone THz networks, as well as the critical importance of accurate near-field modeling in extremely large antenna arrays. Moreover, the proposed HO-aware resource allocation methods effectively mitigate the impact of HOs, enhancing performance in the considered system.
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.001 | 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".