Cited by 559Vehicular Ad Hoc Networks (VANETs)Cognitive Radio Networks and Spectrum SensingTraffic control and management

Spectrum Sharing in Vehicular Networks Based on Multi-Agent Reinforcement Learning

Open access
Liang, Le, Ye, Hao, Li, Geoffrey Ye·2019·IEEE Journal on Selected Areas in Communications

Abstract

This paper investigates the spectrum sharing problem in vehicular networks based on multi-agent reinforcement learning, where multiple vehicle-to-vehicle (V2V) links reuse the frequency spectrum preoccupied by vehicle-to-infrastructure (V2I) links. Fast channel variations in high mobility vehicular environments preclude the possibility of collecting accurate instantaneous channel state information at the base station for centralized resource management. In response, we model the resource sharing as a multi-agent reinforcement learning problem, which is then solved using a fingerprint-based deep Q-network method that is amenable to a distributed implementation. The V2V links, each acting as an agent, collectively interact with the communication environment, receive distinctive observations yet a common reward, and learn to improve spectrum and power allocation through updating Q-networks using the gained experiences. We demonstrate that with a proper reward design and training mechanism, the multiple V2V agents successfully learn to cooperate in a distributed way to simultaneously improve the sum capacity of V2I links and payload delivery rate of V2V links.

Integrity signals

Registry

Crossref · 10.1109/jsac.2019.2933962

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • Due to the dynamic nature of the C-V2X networks and the associated short coherence time interval, centralized solutions are inadequate due to difficulties in acquiring the instantaneous CSI of all links.

    “Due to the dynamic nature of the C-V2X networks and the associated short coherence time interval, centralized solutions are inadequate due to difficulties in acquiring the instantaneous CSI of all links [36].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Liang, L., Ye, H., & Li, G. Y.
Affiliations
  • Intel (United States) (US)
  • Georgia Institute of Technology (US)
Venue
IEEE Journal on Selected Areas in Communications
Published
2019-10
Volume
37
Issue
10
Pages
2282-2292
ISSN
  • 0733-8716 (ISSN-L)
  • 1558-0008
OpenAlex
W2968764495
Cited by
559
References
4
Citations by year
2026: 56 · 2025: 94 · 2024: 105 · 2023: 83 · 2022: 88 · 2021: 89 · 2020: 36 · 2019: 7 · 2012: 1
FWCI
19.77
Type
journal article
Language
en
Open access
Locations
  • IEEE Journal on Selected Areas in Communications (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Intel Corporation
  • National Science Foundation (1731017, 1815637)
Topics
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Vehicular Ad Hoc Networks (VANETs)
  • Physical Sciences › Computer Science › Computer Networks and Communications › Cognitive Radio Networks and Spectrum Sensing
  • Physical Sciences › Engineering › Control and Systems Engineering › Traffic control and management
Keywords
spectrum sharing, vehicular networks, multi-agent reinforcement learning, vehicle-to-vehicle communication, vehicle-to-infrastructure links, deep Q-network, distributed resource allocation, power allocation, reward function design, sum capacity, channel state information

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