Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 205

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Graph-Based Resource Sharing in Vehicular Communication

Liang, Le, Xie, Shijie, Li, Geoffrey Ye, Ding, Zhi, Yu, Xingxing·2018·IEEE Transactions on Wireless Communications

Abstract

This paper investigates the resource allocation problem in device-to-device-based vehicular communications, based on slow fading statistics of channel state information (CSI), to alleviate signaling overhead for reporting rapidly varying accurate CSI of mobile links. We consider the case when each vehicle-to-infrastructure (V2I) link shares spectrum with multiple vehicle-to-vehicle (V2V) links. Leveraging the slow fading statistical CSI of mobile links, we maximize the sum V2I capacity while guaranteeing the reliability of all V2V links. We use graph partitioning tools to divide highly interfering V2V links into different clusters before formulating the spectrum sharing problem as a weighted 3-D matching problem. We propose a suite of algorithms, including a baseline graph-based resource allocation algorithm, a greedy resource allocation algorithm, and a randomized resource allocation algorithm, to address the performance-complexity tradeoffs. We further investigate resource allocation adaption in response to slow fading CSI of all vehicular links and develop a low-complexity randomized algorithm.

Overview

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/twc.2018.2827958

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

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

Self-check

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

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

Citations

Cites

Show all 1 references

Research works printed but not linked: 39

  1. 2016, WF on SLS Evaluation Assumptions for eV2X
  2. west, 2001, Introduction to Graph Theory, 2
  3. 10.1109/TCOMM.2006.873077 · doi:10.1109/tcomm.2006.873077
  4. 10.1109/TWC.2005.858019 · DOI
  5. 10.1109/7693.975444 · DOI · Paper page
  6. 10.1145/321958.321975 · DOI · Paper page
  7. kirkpatrick, 1983, Optimization by simulated annealing, Science, 220, 671, 10.1126/science.220.4598.671 · DOI · Paper page
  8. 10.1007/s004930170004 · doi:10.1007/s004930170004
  9. 10.1007/s10107-011-0451-5 · doi:10.1007/s10107-011-0451-5
  10. 10.1109/VETECF.2002.1040379 · doi:10.1109/vetecf.2002.1040379
  11. 10.1109/WCNC.2014.6952482 · DOI
  12. 2007, WINNER II Channel Models
  13. 10.1109/TVT.2015.2487365 · DOI
  14. 10.1109/TVT.2015.2479248 · DOI · Paper page
  15. 10.1109/TWC.2015.2509978 · DOI · Paper page
  16. 10.1109/TCOMM.2017.2699194 · DOI · Paper page
  17. 10.1109/LWC.2017.2702747 · DOI · Paper page
  18. 10.1016/j.vehcom.2014.08.004 · DOI
  19. shojafar, 0, Energy-efficient adaptive resource management for real-time vehicular cloud services, IEEE Trans Cloud Comput
  20. ye, 2018, Deep reinforcement learning for resource allocation in V2V communications, Proc IEEE ICC
  21. 10.1109/ICC.2009.5198612 · DOI · Paper page
  22. 10.1109/ICC.2017.7996984 · DOI
  23. 10.1109/TVT.2017.2750903 · DOI · Paper page
  24. berman, 2000, A d/2 approximation for maximum weight independent set in d-claw free graphs, Algorithm Theory ? SWAT 98, 214
  25. 10.1109/MIS.2017.53 · DOI · Paper page
  26. 10.1109/JPROC.2011.2132790 · DOI · Paper page
  27. 10.1109/TWC.2016.2597283 · DOI
  28. peng, 0, Vehicular communications: A network layer perspective, IEEE Trans Veh Technol
  29. 2016, Technical Specification Group Radio Access Network Study on LTE-based V2X Services (Release 14)
  30. 2013, Intelligent Transport Systems (ITS) Cooperative ITS (C-ITS) Release 1
  31. 10.1109/MCOM.2013.6515060 · DOI · Paper page
  32. 10.1109/TITS.2014.2377074 · DOI · Paper page
  33. liang, 2018, Graph-based radio resource management for vehicular networks, Proc IEEE ICC
  34. 10.1109/TVT.2009.2014384 · doi:10.1109/tvt.2009.2014384
  35. 10.1109/TVT.2014.2356198 · doi:10.1109/tvt.2014.2356198
  36. 10.1109/TVT.2013.2245156 · DOI
  37. 10.1109/TCOMM.2013.071013.120787 · DOI · Paper page
  38. 10.1109/TSP.2015.2432733 · doi:10.1109/tsp.2015.2432733
  39. 10.1109/JSAC.2012.120108 · DOI

Cited by

See all 205

Metadata

Authors
Liang, L., Xie, S., Li, G. Y., Ding, Z., & Yu, X.
Venue
IEEE Transactions on Wireless Communications
Published
2018-07
Volume
17
Issue
7
Pages
4579-4592
ISSN
  • 1536-1276 (ISSN-L)
  • 1558-2248
OpenAlex
W2799944166
Cited by
205
References
1
FWCI
7.06
Type
journal article
Language
en
Open access
closed
Funders
  • Intel Corporation
  • National Science Foundation (1443894, 1731017, CCF-1443870, CNS-1702752, ECCS-1711823)

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Graph-Based Resource Sharing in Vehicular Communication. https://app.cochat.ai/papers/10.1109/twc.2018.2827958
The paper
Liang, L., Xie, S., Li, G. Y., Ding, Z., & Yu, X. (2018). Graph-Based Resource Sharing in Vehicular Communication. IEEE Transactions on Wireless Communications. https://doi.org/10.1109/twc.2018.2827958

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.