Dynamic Proximity-Aware Resource Allocation in Vehicle-to-Vehicle (V2V) Communications
Open accessThe DOI matches its Crossref record.
Abstract
In this paper, a novel proximity and load-aware resource allocation for vehicle-to-vehicle (V2V) communication is proposed. The proposed approach exploits the spatio-temporal traffic patterns, in terms of load and vehicles' physical proximity, to minimize the total network cost which captures the tradeoffs between load (i.e., service delay) and successful transmissions while satisfying vehicles' quality-of-service (QoS) requirements. To solve the optimization problem under slowly varying channel information, it is decoupled the problem into two interrelated sub-problems. First, a dynamic clustering mechanism is proposed to group vehicles in zones based on their traffic patterns and proximity information. Second, a matching game is proposed to allocate resources for each V2V pair within each zone. The problem is cast as many-to-one matching game in which V2V pairs and resource blocks (RBs) rank one another in order to minimize their service delay. The proposed game is shown to belong to the class of matching games with externalities. To solve this game, a distributed algorithm is proposed using which V2V pairs and RBs interact to reach a stable matching. Simulation results for a Manhattan model shown that the proposed scheme yields a higher percentage of V2V pairs satisfying QoS as well as significant gain in terms of the signal-to- interference-plus-noise ratio (SINR) as compared to a state-of-art resource allocation baseline.
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
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
Distributed Federated Learning for Ultra-Reliable Low-Latency Vehicular Communications
Samarakoon, S., Bennis, M., Saad, W., & Debbah, M. (2020) · IEEE Transactions on Communications · doi:10.1109/tcomm.2019.2956472 · Cited by 459
Self-citationDeep-Learning-Based Wireless Resource Allocation With Application to Vehicular Networks
Liang, L., Ye, H., Yu, G., & Li, G. Y. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2957798 · Cited by 282
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
Federated Learning for Ultra-Reliable Low-Latency V2V Communications
Samarakoon, S., Bennis, M., Saad, W., & Debbah, M. (2018) · 2018 IEEE Global Communications Conference (GLOBECOM) · doi:10.1109/glocom.2018.8647927 · Cited by 25
Self-citationUrmonov, O., Aliev, H., & Kim, H. (2023) · IEEE Systems Journal · doi:10.1109/jsyst.2022.3197880 · Cited by 24
Metadata
- Authors
- Ashraf, M. I., Bennis, M., Perfecto, C., & Saad, W.
- Venue
- 2016 IEEE Globecom Workshops (GC Wkshps)
- Publisher
- IEEE
- Published
- 2016-12
- Pages
- 1-6
- OpenAlex
- W2520659666
- Cited by
- 93
- References
- 0
- FWCI
- 10.36
- Type
- conference paper
- Language
- en
- Open access
- green
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
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.