LBT-Based Adaptive Channel Access for LTE-U Systems
Bibliographic record
Abstract
Driven by the demand for more radio spectrum resources, mobile operators are looking to exploit the unlicensed spectrum as a complement to the licensed spectrum. LTE-unlicensed (LTE-U), also referred to as licensed-assisted access by the third generation partnership project, is an extension of the LTE standard operating on the unlicensed spectrum. To realize LTE-U, its coexistence with Wi-Fi systems is the main challenge and must be addressed. In this paper, a listen-before-talk access mechanism featuring an adaptive distributed control function protocol is adopted for the small base stations (SBSs), whereby the backoff window size is adaptively adjusted according to the available licensed spectrum bandwidth and the Wi-Fi traffic load to satisfy the quality-of-service requirements of small cell users and minimize the collision probability of Wi-Fi users. Meanwhile, both licensed and unlicensed spectrum bands are jointly allocated to optimize spectrum efficiency. An admission control mechanism is further developed for the SBS to limit collision with Wi-Fi traffic. Extensive simulation results show that the proposed schemes achieve fair and harmonious coexistence between LTE-U small cells and the surrounding Wi-Fi service sets and substantially outperform baseline non-adaptive channel access mechanisms in the unlicensed spectrum.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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 source (direct Gemma or distilled Codex), 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".