Cited by 870Vehicular Ad Hoc Networks (VANETs)Traffic control and managementAdvanced Wireless Network Optimization

Deep Reinforcement Learning Based Resource Allocation for V2V Communications

Open access
Ye, Hao, Li, Geoffrey Ye, Juang, Biing-Hwang Fred·2019·IEEE Transactions on Vehicular Technology

Abstract

In this paper, we develop a novel decentralized resource allocation mechanism for vehicle-to-vehicle (V2V) communications based on deep reinforcement learning, which can be applied to both unicast and broadcast scenarios. According to the decentralized resource allocation mechanism, an autonomous “agent,” a V2V link or a vehicle, makes its decisions to find the optimal sub-band and power level for transmission without requiring or having to wait for global information. Since the proposed method is decentralized, it incurs only limited transmission overhead. From the simulation results, each agent can effectively learn to satisfy the stringent latency constraints on V2V links while minimizing the interference to vehicle-to-infrastructure communications.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tvt.2019.2897134

Cites

28 of 28 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • One major obstacle associated with Deep-SHAP based SHAP values estimation is the considerable computational complexity, which increases exponentially with the number of state features and linearly with the number of background data samples.

    “One major obstacle associated with the Deep-SHAP based SHAP values estimation is the considerable computational complexity, which increases exponentially with the number of state features and linearly with the number of background data samples [40].”

    From Explainable AI-Aided Feature Selection and Model Reduction for DRL-Based V2X Resource Allocation (2025) · cites this paper as [40]

    The Discussion section discusses the computational complexity of the paper’s deep reinforcement-learning method, not Deep-SHAP. Searches for Deep-SHAP, SHAP values, background samples, and feature-attribution complexity found no passage addressing the claimed exponential or linear scaling. Page numbers were unavailable in our copy. (LLM, conf=0.78)

    Experimental — accuracy not yet measured
  • SHAP provides a computationally efficient way to calculate Shapley values by iterating over a small subset of possible feature permutations using sampling approximations.

    “As a remedy, SHAP provides a computationally efficient way to calculate Shapley values by iterating over a small subset of possible feature permutations using sampling approximations [40].”

    From Explainable AI-Aided Feature Selection and Model Reduction for DRL-Based V2X Resource Allocation (2025) · cites this paper as [40]

    The Training and Testing Algorithms section describes sampling mini-batches for deep Q-learning, not sampling feature permutations to calculate Shapley values. The Discussion addresses computational complexity of the V2V resource-allocation method. Searches for SHAP, Shapley values, and feature-attribution sampling found no passage addressing the claim; page numbers were not available in our copy. (LLM, conf=0.78)

    Experimental — accuracy not yet measured
  • Deep-SHAP is an extended version designed specifically for DNNs and adapts DeepLIFT algorithm to approximate Shapley values by linearizing the non-linear components of DNNs.

    “Moreover, Deep Shapley additive explanation (Deep-SHAP) is an extended version designed specifically for DNNs and adapts DeepLIFT algorithm to approximate Shapley values by linearizing the non-linear components of DNNs [40].”

    From Explainable AI-Aided Feature Selection and Model Reduction for DRL-Based V2X Resource Allocation (2025) · cites this paper as [40]

    The Deep Q-Learning section describes a neural network used to estimate Q-values for V2V resource allocation, not a method for explaining DNNs. Searches for Deep-SHAP, DeepLIFT, Shapley values, and feature attribution found no passage addressing the claimed method in our copy. (LLM, conf=0.78)

    Experimental — accuracy not yet measured
  • DeepSHAP adds explainability to the DNNs by decomposing the output prediction of DNNs on a specific input by backpropagating the contributions of all neurons to every input feature.

    “DeepSHAP adds explainability to the DNNs by decomposing the output prediction of DNNs on a specific input by backpropagating the contributions of all neurons to every input feature.”

    From Explainable AI-Aided Feature Selection and Model Reduction for DRL-Based V2X Resource Allocation (2025) · cites this paper as [40]

    The Deep Q-Learning section (page unavailable) describes a DNN that produces Q-values, not a method for explaining its predictions. Searches for DeepSHAP, SHAP, feature attribution, and backpropagated contributions found no passage in our copy addressing the claim. (LLM, conf=0.78)

    Experimental — accuracy not yet measured
  • Instead of using a single reference value, Deep-SHAP exploits a distribution of background samples such that the resulting Shapley values sum up to the difference between the expected model output on the passed background samples and the current model output.

    “Instead of using a single reference value, Deep-SHAP exploits a distribution of background samples such that the resulting Shapley values sum up to the difference between the expected model output on the passed background samples and the current model output.”

    From Explainable AI-Aided Feature Selection and Model Reduction for DRL-Based V2X Resource Allocation (2025) · cites this paper as [40]

    Split into 2 atoms — 0 confirmed, 0 partially supported, 0 disputed, 0 misattributed, 2 unverifiable. Expand the claim to see per-atom verdicts.

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Ye, H., Li, G. Y., & Juang, B.-H. F.
Affiliations
Georgia Institute of Technology (US)
Venue
IEEE Transactions on Vehicular Technology
Published
2019-04
Volume
68
Issue
4
Pages
3163-3173
ISSN
  • 0018-9545 (ISSN-L)
  • 1939-9359
OpenAlex
W2963000651
Cited by
870
References
28
Citations by year
2026: 91 · 2025: 113 · 2024: 124 · 2023: 117 · 2022: 138 · 2021: 138 · 2020: 106 · 2019: 42 · 2012: 1
FWCI
38.07
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Vehicular Technology (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
National Science Foundation (1815637, 1731017)
Topics
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Vehicular Ad Hoc Networks (VANETs)
  • Physical Sciences › Engineering › Control and Systems Engineering › Traffic control and management
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Network Optimization
Keywords
vehicle-to-vehicle communication, resource allocation, deep reinforcement learning, decentralized decision-making, sub-band allocation, power allocation, broadcast communication, unicast communication, delay constraints, autonomous vehicles

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review