Downlink cell association for large-scale MIMO HetNets employing small cell wireless backhaul
Bibliographic record
Abstract
Downlink cell association (CA) is studied for cellular heterogeneous networks (HetNets) where large-scale antenna array is implemented at the macro base station (BS), while the opportunistically deployed small cells are single-antenna nodes, and they rely on over-the-air links to the macro base station for backhaul. The coupling constraint due to in-band wireless backhaul becomes another key criterion for cell association. A duplex and spectrum sharing scheme based on reverse timedivision duplex (TDD) is considered for interference management in the HetNet under the wireless backhaul constraint. A sum logarithmic-throughput maximization problem is formulated to balance throughput and fairness. By relaxing the binary cell association indicator variables, the optimization problem is shown to be a convex problem. Dual decomposition for relaxed optimization is employed to solve the integer nonlinear CA problem, which results in a distributed CA algorithm. Improved performance and fairness are achieved with the proposed algorithm under the wireless backhaul constraint, and more small cells implemented within the macro cell range achieves better load balancing. As no additional radio frequency hardware is required by the proposed scheme, it allows low-cost and fast implementation of wireless backhaul enabled cellular HetNets.
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.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".