MétaCan
Menu
Back to cohort
Record W3135048088 · doi:10.1109/access.2021.3062627

UAV-Enabled Wireless Backhaul Networks Using Non-Orthogonal Multiple Access

2021· article· en· W3135048088 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 Access · 2021
Typearticle
Languageen
FieldEngineering
TopicUAV Applications and Optimization
Canadian institutionsUniversité Laval
FundersMinistry of Science and ICT, South KoreaNational Research Foundation of KoreaInstitute for Information and Communications Technology PromotionPusan National UniversityNational Research Foundation
KeywordsComputer scienceBackhaul (telecommunications)WirelessTelecommunications linkConvexityWireless networkComputer networkMathematical optimizationBandwidth (computing)Distributed computingBandwidth allocationTelecommunications

Abstract

fetched live from OpenAlex

Owing to their potential mobility and agility, unmanned aerial vehicles (UAVs) have captured predominant interests in sustaining 5G wireless communication and beyond. In this paper, we scrutinize the downlink transmission of UAV-enabled wireless backhaul networks in which non-orthogonal multiple access is incorporated to boost up the massive connectivity and high spectra efficiency. More precisely, our aim is to maximize the worst ground user's achievable rate by optimizing bandwidth allocation, UAV's power allocation and placement. The formulated problem is non-convex and not easy to solve optimally. Consequently, to deal with the complexity and non-convexity of our problem, we develop a path following procedure and generate a less-onerous algorithm that is iteratively run till convergence. The simulation results are executed to validate not only the effectiveness, but also the convergence of the proposed method. In addition, a comparison with other alternative schemes is depicted to divulge the outperformance of our proposed algorithm.

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.541
Threshold uncertainty score0.877

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
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.026
GPT teacher head0.276
Teacher spread0.250 · 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