A Game Theoretic Scheme for Optimal Access Control in Heterogeneous Vehicular Networks
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
The heterogeneous vehicular networks (HetVNETs), which apply the heterogeneous access technologies (e.g., cellular networks and WiFi) complementarily to provide seamless and ubiquitous connections to vehicles, have emerged as a promising and practical paradigm to enable vehicular service applications on the road. However, with different costs in terms of latency time and price, how to optimize the connection along the vehicle's trip toward the lowest cost represents fundamental challenges. This paper investigates the issue by proposing an optimal access control scheme for vehicles in HetVNETs. In specific, with different access networks, we first model the cost of each vehicle to download the requested content by jointly considering the vehicle's requirements of the requested content and the features of the available access networks, including conventional vehicle to vehicle communication and the heterogeneous access technologies. A coalition formation game is then introduced to formulate the cooperation among vehicles based on their different interests (contents cached in vehicles) and requests (contents to be downloaded). After forming the coalitions, vehicles in the same coalition can download their requested contents cooperatively by selecting the optimal access network to achieve the minimum costs. The simulation results demonstrate that the proposed game approach can lead to the optimal strategy for the vehicle.
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
Minimizing Convergecast Time and Energy Consumption in Green Internet of Things
Li, Z., Liu, Y., Liu, A., Wang, S., & Liu, H. (2020) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2018.2844282 · Cited by 124
Cited by
BSIS: Blockchain-Based Secure Incentive Scheme for Energy Delivery in Vehicular Energy Network
Wang, Y., Su, Z., & Zhang, N. (2019) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2908497 · Cited by 218
Self-citationSecure and Personalized Edge Computing Services in 6G Heterogeneous Vehicular Networks
Hui, Y., Cheng, N., Su, Z., Huang, Y., Zhao, P., Luan, T. H., & Li, C. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3065970 · Cited by 76
Self-citationApplications of Game Theory in Vehicular Networks: A Survey
Sun, Z., Liu, Y., Wang, J., Li, G., Anil, C., Li, K., Guo, X., Sun, G., Tian, D., & Cao, D. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3108466 · Cited by 68
“It should be considered not only which type of network to switch [128], but also how to guarantee the continuity in a short delay between two SPs.”
BackgroundMethodInfluential
Metadata
- Authors
- Hui, Y., Su, Z., Luan, T. H., & Cai, J.
- Venue
- IEEE Transactions on Intelligent Transportation Systems
- Published
- 2019-12
- Volume
- 20
- Issue
- 12
- Pages
- 4590-4603
- ISSN
- 1524-9050 (ISSN-L)
- 1558-0016
- OpenAlex
- W2919351369
- Cited by
- 49
- References
- 1
- FWCI
- 3.35
- 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: A Game Theoretic Scheme for Optimal Access Control in Heterogeneous Vehicular Networks. https://app.cochat.ai/papers/10.1109/tits.2019.2894716
- The paper
- Hui, Y., Su, Z., Luan, T. H., & Cai, J. (2019). A Game Theoretic Scheme for Optimal Access Control in Heterogeneous Vehicular Networks. IEEE Transactions on Intelligent Transportation Systems. https://doi.org/10.1109/tits.2019.2894716
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.