Toward Optimal Admission Control and Resource Allocation for LTE-A Femtocell Uplink
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
The Third-Generation Partnership Project (3GPP) has incorporated femtocell (FC) technology in the Long-Term Evolution Advanced (LTE-A) standard to enhance the quality of service of indoor mobile users and extend the coverage area of existing macrocells (MCs). In such two-tier LTE-A MC/FC systems, cotier and cross-tier interference exists in cochannel deployment, exerting adverse effects on system performance. In this paper, we study the single-carrier frequency-division multiple-access (SC-FDMA)-based LTE-A FC uplink. We propose the use of transport-layer data admission control (AC) in femto user equipment (FUE) and interference-aware resource allocation (RA) in each base station (BS) to manage the intercell interference (ICI). We first formulate the problem as a constrained Markov decision problem (CMDP) that aims at maximizing the time-average throughput of the entire FC tier subject to the queue stability constraint for each FUE. Then, we propose a joint AC and RA (JACRA) algorithm to obtain the optimal AC and RA policies. In light of the NP-hardness of the RA subproblem, we further propose an iterative heuristic with polynomial time complexity. Simulation studies show that the proposed JACRA algorithm is throughput optimal, outperforming alternative proportional fair (PF) and round robin (RR) scheduling schemes. Moreover, the proposed heuristic achieves near-optimal throughput with substantial improvement in computational complexity.
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.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