Low Complexity Outage Optimal Distributed Channel Allocation for Vehicle-to-Vehicle Communications
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communications, has recently been receiving much attention. Because of both safety and non-safety real-time applications, V2V communications has QoS requirements on rate, latency, and reliability. How to appropriately design channel allocation is therefore a key MAC/PHY layer issue in vehicular communications. The QoS requirements of real-time V2V communications can be met by achieving a low outage probability and high outage capacity. In this paper, we first formulate the subchannel allocation in V2V communications into a maximum matching problem on random bipartite graphs. A distributed shuffling based Hopcroft-Karp (DSHK) algorithm will then be proposed to solve this problem with a sub-linear complexity of O(N^{2/3}), where N is the number of subchannels. By studying the maximum matching generated by the DSHK algorithm on random bipartite graphs, the outage probabilities are derived in the high (two near vehicles) and low (two far away vehicles) SNR regimes, respectively. It is then demonstrated that the proposed method has a similar outage performance as the scenario of two communicating vehicles occupying N subchannels. By solving high degree algebraic equations, the outage capacity can be obtained to determine the maximum traffic rate given an outage probability constraint. It is also shown that the proposed scheme can take an advantage of small signaling overhead with only one-bit channel state information broadcasting for each subchannel.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Bollobás, B. (2001) · doi:10.1017/cbo9780511814068 · Cited by 2,639
Cited by
Deep Reinforcement Learning Based Resource Allocation for V2V Communications
Ye, H., Li, G. Y., & Juang, B.-H. F. (2019) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2019.2897134 · Cited by 870
Deep Reinforcement Learning for Resource Allocation in V2V Communications
Ye, H., & Li, G. Y. (2018) · 2018 IEEE International Conference on Communications (ICC) · doi:10.1109/icc.2018.8422586 · Cited by 222
Li, X., Lu, L., Ni, W., Jamalipour, A., Zhang, D., & Du, H. (2022) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2022.3173057 · Cited by 188
Metadata
- Authors
- Bai, B., Chen, W., Letaief, K. B., & Cao, Z.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2011-01
- Volume
- 29
- Issue
- 1
- Pages
- 161-172
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2036990527
- Cited by
- 36
- References
- 1
- FWCI
- 1.11
- Type
- journal article
- Language
- en
- Open access
- closed
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: Low Complexity Outage Optimal Distributed Channel Allocation for Vehicle-to-Vehicle Communications. https://app.cochat.ai/papers/10.1109/jsac.2011.110116
- The paper
- Bai, B., Chen, W., Letaief, K. B., & Cao, Z. (2011). Low Complexity Outage Optimal Distributed Channel Allocation for Vehicle-to-Vehicle Communications. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/jsac.2011.110116
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.