MétaCan
Menu
Back to cohort
Record W3180101895 · doi:10.1109/lnet.2021.3096481

Resource Allocation, Trajectory Optimization, and Admission Control in UAV-Based Wireless Networks

2021· article· en· W3180101895 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Networking Letters · 2021
Typearticle
Languageen
FieldEngineering
TopicUAV Applications and Optimization
Canadian institutionsInstitut National de la Recherche ScientifiqueUniversité du Québec à Montréal
Fundersnot available
KeywordsComputer scienceMaximizationMathematical optimizationAdmission controlResource allocationTrajectory optimizationTrajectoryInteger programmingLinear programmingInteger (computer science)Optimization problemBlock (permutation group theory)Iterative methodWirelessNonlinear programmingNonlinear systemAlgorithmOptimal controlComputer networkMathematics

Abstract

fetched live from OpenAlex

In this letter, we study the resource allocation and trajectory optimization for multi-UAV based wireless networks. Our design maximizes the number of admitted users while satisfying their data transmission demands, which formulates a mixed-integer nonlinear problem. To tackle its difficulty, we first introduce soft admission variables and propose an iterative algorithm to solve this admission maximization problem. Each iteration comprises two steps, namely soft admission maximization and user removal. Our method guarantees that the number of admitted users increases over iterations. Numerical results show that our algorithm outperforms the conventional approach based on block coordinate ascent and mixed-integer linear programming.

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 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: Empirical · Consensus signal: none
Teacher disagreement score0.958
Threshold uncertainty score0.741

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.0000.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.005
GPT teacher head0.178
Teacher spread0.173 · 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