MétaCan
Menu
Back to cohort

Dual-UAV Aided Secure Dynamic G2U Communication

2022· article· en· W4312334812 on OpenAlexaff
Hongyue Kang, Wei Li, Jelena Mišić, Vojislav B. Mišić, Xiaolin Chang

Bibliographic record

Venue2022 IEEE Symposium on Computers and Communications (ISCC) · 2022
Typearticle
Languageen
FieldEngineering
TopicUAV Applications and Optimization
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsComputer scienceMarkov decision processReinforcement learningBenchmark (surveying)WirelessTrajectoryTransmitter power outputReal-time computingPower (physics)Markov processTransmitterControl theory (sociology)Artificial intelligenceComputer networkTelecommunicationsControl (management)Mathematics

Abstract

fetched live from OpenAlex

Unmanned aerial vehicle (UAV) communication is easily wiretapped by malignant nodes due to the broadcast nature of line-of-sight (LoS) wireless channels. To tackle this problem, this paper investigates a dual-UAV aided secure dynamic ground-to-UAV (G2U) communication system. By dynamic, we mean UAVs communicate with moving ground devices (GDs). Our objective is maximizing the sum secrecy rate by the joint optimization of UAV trajectory and GDs transmit power. To achieve it, we first formulate this nonconvex optimization problem as a Constrained Markov Decision Process (CMDP) under the constraints of UAV flying speed, initial and final locations, limited energy, and average transmit power. Then, a Deep Deterministic Policy Gradient (DDPG) based deep reinforcement learning algorithm is designed, named SC-TDPC, to learn the optimal transmit power and UAV trajectory. The experiment results demonstrate that, compared to other benchmark schemes, SC-TDPC can efficiently enhance the UAV communication security in terms of sum secrecy rate.

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.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation 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.003
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.006
GPT teacher head0.209
Teacher spread0.202 · 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 designSimulation or modeling
Domainnot available
GenreEmpirical

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

Citations1
Published2022
Admission routes1
Has abstractyes

Explore more

Same venue2022 IEEE Symposium on Computers and Communications (ISCC)Same topicUAV Applications and OptimizationFrench-language works237,207