MétaCan
Menu
Back to cohort
Record W2996396392 · doi:10.1109/lcomm.2019.2959525

Joint Channel Assignment and Occupancy Time Optimization in Frame-Based Listen-Before-Talk

2019· article· en· W2996396392 on OpenAlexafffund
Sina Khoshabi Nobar, Mohamed H. Ahmed, Yasser Morgan, S. Mahmoud

Bibliographic record

VenueIEEE Communications Letters · 2019
Typearticle
Languageen
FieldComputer Science
TopicWireless Networks and Protocols
Canadian institutionsUniversity of ReginaMemorial University of NewfoundlandCarleton University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceChannel (broadcasting)Frame (networking)Optimization problemLyapunov optimizationAssignment problemMathematical optimizationTime complexityInteger programmingLinear programmingComputer networkNetwork packetAlgorithmMathematics

Abstract

fetched live from OpenAlex

We study the performance optimization problem of the long term evolution (LTE) network operating in the unlicensed band and sharing it with an existing WiFi network. We consider the LTE network to be based on the frame-based listen-before-talk protocol. We formulate the joint channel assignment and channel occupancy time optimization problem using a stochastic integer programming (IP) model. By applying the Lyapunov drift-plus-penalty theorem, we develop an asymptotically optimal solution with polynomial time-complexity for the stochastic IP problem. Numerical results are presented and the performance of the proposed solution is compared to the performance of two alternative approaches in which the channel assignment and channel occupancy time are determined sequentially.

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 distilled prediction

Teacher imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.879
Threshold uncertainty score0.556

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.021
GPT teacher head0.247
Teacher spread0.226 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
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

Citations4
Published2019
Admission routes2
Has abstractyes

Explore more

Same venueIEEE Communications LettersSame topicWireless Networks and ProtocolsFrench-language works237,207