MétaCan
Menu
Back to cohort
Record W2771819322 · doi:10.1109/wcsp.2017.8171008

Achieving optimum throughput for LTE and WiFi coexistence

2017· article· en· W2771819322 on OpenAlexaff
Xinghua Sun, Jun Zhang, Victor C. M. Leung, Hongbo Zhu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Networks and Protocols
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsThroughputComputer networkComputer scienceSpectrum managementConstraint (computer-aided design)WirelessTelecommunicationsCognitive radioEngineering

Abstract

fetched live from OpenAlex

In this paper, we consider how to achieve optimum throughput when LTE with listen before talk (LBT) shares the unlicensed spectrum with WiFi. Basically, we aim to address two problems: 1) How can WiFi access point (AP) and WiFi station (STN) configure the access parameters to maximize the throughput of their own networks when they have knowledge of the access parameter of LTE? 2) How to jointly tune the access parameters of both networks towards the maximum throughput of the whole network? It is found that even when the WiFi network optimally configures the access parameters, the throughput gain is marginal when LTE accesses the unlicensed spectrum with a fixed backoff window size, which necessitates a joint tuning of the access parameters of both parties. With joint tuning, nevertheless, the throughput of the whole network is maximized when only the LTE uses the unlicensed spectrum. To provide a fair coexistence to the WiFi network, the throughput optimization problem is considered under the constraint that the WiFi network share a given portion of the throughput of the whole network. Explicit expressions of optimal access parameters are obtained for both LTE and WiFi networks, which provide direct guidance for harmonious coexistence of the two systems.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.006
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.002
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.006
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0020.003
Open science0.0010.002
Research integrity0.0020.001
Insufficient payload (model declined to judge)0.0020.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.

Opus teacher head0.052
GPT teacher head0.329
Teacher spread0.277 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designNot applicable
Domainnot available
GenreMethods

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".

Quick stats

Citations2
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicWireless Networks and ProtocolsFrench-language works237,207