Two-Side Coalitional Matching Approach for Joint MIMO-NOMA Clustering and BS Selection in Multi-Cell MIMO-NOMA Systems
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
Resource management in multi-cell multiple-input multiple-output non-orthogonal multiple access (MIMO-NOMA) is challenged by computational complexity, flexible clustering, and potential channel correlation. In this paper, we focus on a combined resource allocation problem: NOMA mobile user (MU) clustering and the base station (BS) selection, to improve system data rate. Different from sum data rate maximization and max-min fairness, we introduce a new objective function, i.e., relative fairness, which integrates MU fairness into system data rate optimization to overcome the domination effect of BS in advantaged situations of sum data rate improving. Moreover, we derive the closed form solution of MIMO-NOMA resource allocation for a single cluster, and it can be employed for any size of cluster. Furthermore, we propose a new two-side coalitional matching approach to jointly optimize MIMO-NOMA clustering and BS selection, which is able to balance the tradeoff between MUs' individual benefits and the overall network performance. The proposed approach is core stable. Pauta-criterion is employed on system performance evaluation to provide a judgement on win-win solutions. In simulation, extensive comparisons provide insightful understanding of our proposed MIMO-NOMA clustering strategy, relative fairness, and the proposed two-side coalitional matching approach.
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.001 | 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.001 |
| 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