Why user swapping could be the best coordination mechanism in a cellular network?
Bibliographic record
Abstract
We propose a technique that can be used to improve the throughput offered to cellular users, in particular cell-edge users. Often, base stations (BSs) of different network operators are not co-located. Because of this, more spatial diversity is available by considering multiple cellular networks. Users who do not have a high SINR in their home network might see a much better SINR in another network because of the spatial diversity. Hence, to improve the performance of their cell-edge users, network operators can “swap” (exchange) them. In essence, we want to allow roaming between operators for other reasons than pure coverage. This paper aims at quantifying the gains that can be obtained by such swapping techniques. We propose a swapping scheme, “Operator-Based Swapping”, in which a central controller decides which users should be exchanged between two operators assuming the number of users served by an operator does not change. Although implementing such a centralized scheme would be difficult, it helps us to understand the potential gain of such a “swapping” technique. Our numerical results show that high throughput gains (e.g., 80%) are achievable for the 10% worst users for both operators if the two networks are spatially diverse. We then propose a second swapping technique, called “BS-Based Swapping”, that restricts the number of exchanged users to be equal on a pair of BS-basis. We believe that this scheme might be easier to implement. We compare the performance of this scheme under different configurations representing different levels of spatial diversity and allocated resources including time and frequency. Our numerical results show that this second swapping technique works almost as well as the first one. Our results show the potential of a technique based on a generalization of roaming as a mean to improve user performance.
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.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 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".