Distributed clustering and interference management in two-tier 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
Employing centralized resource management schemes is generally infeasible in large-scale networks. The deployment of heterogeneous Femtocell Access Points (FAPs) over the cellular licensed spectrum is therefore challenging. In particular, the resulting inter-node interference inhibits the network performance. In this paper, we design a hierarchical, distributed, interference management scheme that exploits the benefits of clustering. First, in order to reduce the cross-tier interference, each FAP independently identifies vacant subbands for potential transmission. Then, by exchanging some simple messages with its immediate neighbors in an iterative fashion, coalition clusters are formed. Given the small population of each group, centralized resource management is subsequently performed to avoid intra-cluster interference. Different clusters, however, may still share a fraction of common idle channels, which degrades system performance. Therefore, this paper further considers inter-cluster interference management to determine the set of privileged FAPs that can share a subband via solving a binary power control optimization problem. While the optimal solution requires prohibitive complexity, this paper provides tight bounds on the sum rate of the binary power control problem. The simulation results show that, in a high interference regime, inter-cluster coordination provides a significant performance improvement compared to the case of no coordination.
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.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.001 |
| Open science | 0.001 | 0.002 |
| 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