A Matching Game for Decoupled Uplink-Downlink User Association in Full-Duplex Small Cell Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In multi-tier cellular/small cell networks, user performance is largely affected by the varying transmit powers, distances, and non- uniform traffic loads of different BSs in both the downlink (DL) and uplink (UL) directions of transmission. To optimize user performance in such networks, decoupled UL-DL association (DUDe) has recently been investigated. DUDe enables a user to be associated with different BSs for UL and DL transmissions. In this paper, we investigate the feasibility of DUDe in a full-duplex two-tier cellular network. Our objective is to associate users to their preferred BSs to maximize the overall user rate both in UL and DL with a provisioning for decoupled association. We formulate the UL and DL user association problem as a matching game where users and BSs rank one another using well-defined preference metrics such that their total UL and DL throughput is maximized. When compared to DUDe in half-duplex networks, in full-duplex networks it introduces new types of interferences such as UL to DL interference or DL to UL interference. The preference metrics are thus defined as a function of achievable UL and DL signal-to- interference noise ratio (SINR). Simulation results are presented to compare the performance of the proposed user association scheme with those of the traditional DUDe and coupled user association schemes where simple user association criteria (e.g., path-loss in the UL and received signal power in the DL) are used for UL and DL transmissions.
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.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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 it