Smart Network Slicing for Vehicular Fog-RANs
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Modern transportation systems are facing a sharp alteration since the Internet of Vehicles (IoV) has activated intense information exchange among vehicles, infrastructure, and pedestrians. Existing approaches fail in efficiently handling the heterogeneous network traffic because of the complicated network environment and dynamic vehicle density. Recently, the fog-radio access network with network slicing has emerged as a promising solution to fulfill the demands of the maldistributed network traffic. However, available fog resources as well as network traffic are all dynamic and unpredictable due to high mobility of vehicles, which results in weak resource utilization. To address this problem, we propose a smart slice scheduling scheme in vehicular fog radio access networks. This scheduling scheme is formed as a Markov decision process. Accordingly, an intelligent algorithm for network slices is proposed based on the Monte Carlo tree search in terms of a new metric cross entropy, which is able to allocate the resource allocation for the match of traffic load in the time-space domain. This slice scheduling algorithm does not require any prior knowledge of the network traffic. Furthermore, this paper first reveals the relationship between road traffic and the IoV resource based on the metric perception-reaction time. A collaborative scheduling scheme is proposed to tune the road traffic speed to further release available IoV resource under the heavy traffic load. Simulation results indicate that the proposed algorithm outperforms several baselines in terms of throughput and delay with low complexity.
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
A Survey of Monte Carlo Tree Search Methods
Browne, C. B., Powley, E., Whitehouse, D., Lucas, S. M., Cowling, P. I., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., & Colton, S. (2012) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2012.2186810 · Cited by 2,970 · cited 1×
“A state t = (Mt,Wt, Sl) is considered as a tree node n(t), with the count of visited times N(t, a) and the Upper Confidence bound for Trees (UCT) Q(t, a) [25].”
BackgroundNetwork Slicing and Softwarization: A Survey on Principles, Enabling Technologies, and Solutions
Afolabi, I., Taleb, T., Samdanis, K., Ksentini, A., & Flinck, H. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2815638 · Cited by 1,078 · cited 1×
“play the essential role in the next generation networks, which support service management, isolation and multiple-tenancy on shared physical resources [10].”
Background
Cited by
Pham, Q.-V., Fang, F., Ha, V. N., Piran, M. J., Le, M., Le, L. B., Hwang, W.-J., & Ding, Z. (2020) · IEEE Access · doi:10.1109/access.2020.3001277 · Cited by 870
Chai, H., Leng, S., Chen, Y., & Zhang, K. (2021) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2020.3002712 · Cited by 332
Self-citationSDN/NFV-Empowered Future IoV With Enhanced Communication, Computing, and Caching
Zhuang, W., Ye, Q., Lyu, F., Cheng, N., & Ren, J. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2951169 · Cited by 301
On 5G-V2X Use Cases and Enabling Technologies: A Comprehensive Survey
Alalewi, A., Dayoub, I., & Cherkaoui, S. (2021) · IEEE Access · doi:10.1109/access.2021.3100472 · Cited by 207
Blockchain Intelligence for Internet of Vehicles: Challenges and Solutions
Wang, X., Zhu, H., Ning, Z., Guo, L., & Zhang, Y. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3305312 · Cited by 131
Metadata
- Authors
- Xiong, K., Leng, S., Hu, J., Chen, X., & Yang, K.
- Venue
- IEEE Transactions on Vehicular Technology
- Published
- 2019-04
- Volume
- 68
- Issue
- 4
- Pages
- 3075-3085
- ISSN
- 0018-9545 (ISSN-L)
- 1939-9359
- OpenAlex
- W2917742948
- Cited by
- 74
- References
- 2
- FWCI
- 7.30
- 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: Smart Network Slicing for Vehicular Fog-RANs. https://app.cochat.ai/papers/10.1109/tvt.2019.2900234
- The paper
- Xiong, K., Leng, S., Hu, J., Chen, X., & Yang, K. (2019). Smart Network Slicing for Vehicular Fog-RANs. IEEE Transactions on Vehicular Technology. https://doi.org/10.1109/tvt.2019.2900234
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.