MétaCan
Menu
Back to cohort
Record W3015795817 · doi:10.1109/tvt.2020.2986088

Secrecy Rate Maximization via Radio Resource Allocation in Cellular Underlaying V2V Communications

2020· article· en· W3015795817 on OpenAlexafffund
Yiliang Liu, Wei Wang, Hsiao‐Hwa Chen, Liangmin Wang, Nan Cheng, Weixiao Meng, Xuemin Shen

Bibliographic record

VenueIEEE Transactions on Vehicular Technology · 2020
Typearticle
Languageen
FieldEngineering
TopicVehicular Ad Hoc Networks (VANETs)
Canadian institutionsUniversity of Waterloo
FundersNatural Sciences and Engineering Research Council of CanadaMinistry of Science and Technology, TaiwanNational Natural Science Foundation of China
KeywordsComputer scienceComputer networkResource allocationCellular networkArtificial noiseTransmitter power outputSignal-to-interference-plus-noise ratioWirelessSignal-to-noise ratio (imaging)Interference (communication)SecrecyTelecommunications linkTransmitterPower (physics)TelecommunicationsChannel (broadcasting)

Abstract

fetched live from OpenAlex

In device-to-device (D2D) underlaying vehicle-to-vehicle (V2V) communications, radio resource blocks (RBs) are allocated to primary cellular users, which yields sub-optimal rates and a long access latency for secondary D2D-enabled vehicles. This work investigates a joint radio resource and power management (RRPM) problem for secure cellular underlaying V2V communications, where cellular users and vehicles have the same priority, giving vehicles more opportunities to access the RBs. Specifically, we aim to maximize secrecy rates of V2V channels under the condition that eavesdropper has an adaptive receiving detection vector to maximize the received signal-to-interference-plus-noise ratio (SINR) from vehicles. For a single pair of a vehicle and a cellular user, the closed-form optimal power allocation expressions are derived for the interference-limited scenario and the noise-limited scenario, respectively. Moreover, for multiple pairs of vehicles and cellular users, a 3-partite hypergraph based 3-dimensional matching approach is proposed to solve a mixed-integer and non-convex problem, which achieves a near-optimal result with an O(n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4</sup> ) time complexity. Simulations in different scenarios show that the secrecy rate of the proposed scheme can be improved by 50% if compared to existing schemes.

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 categoriesMeta-epidemiology (narrow)
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.919
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.002
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0010.001
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.014
GPT teacher head0.204
Teacher spread0.190 · 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.

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

Citations37
Published2020
Admission routes2
Has abstractyes

Explore more

Same venueIEEE Transactions on Vehicular TechnologySame topicVehicular Ad Hoc Networks (VANETs)French-language works237,207