V2X Routing in a VANET Based on the Hidden Markov Model
The DOI matches its Crossref record.
Abstract
It is very difficult to establish and maintain end-to-end connections in a vehicle ad hoc network (VANET) as a result of high vehicle speed, long inter-vehicle distance, and varying vehicle density. Instead, a store-and-forward strategy has been considered for vehicle communications. The success of this strategy, however, depends heavily on the cooperation among nodes. Different from exiting store-and-forward solutions, we propose predictive routing based on the hidden Markov model (PRHMM) for VANETS, which exploits the regularity of vehicle moving behaviors to increase the transmission performance. As vehicle movements often exhibit a high degree of repetition, including regular visits to certain places and regular contacts during daily activities, we can predict a vehicle's future locations based on the knowledge of past traces and the hidden Markov model. Consequently, the short-term route of a vehicle and its packet delivery probability for a specific mobile destination can be predicted. Moreover, PRHMM enables seamless handoff between vehicle-to-vehicle and vehicle-to-infrastructure communications so that the transmission performance will not be constrained by the vehicle density and moving speed. Simulation evaluation demonstrates that PRHMM performs much better in terms of delivery ratio, end-to-end delay, traffic overhead, and buffer occupancy.
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
Reconfigurable Intelligent Surfaces: Principles and Opportunities
Liu, Y., Liu, X., Mu, X., Hou, T., Xu, J., Di Renzo, M., & Al-Dhahir, N. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3077737 · Cited by 1,847
Survey on 6G Frontiers: Trends, Applications, Requirements, Technologies and Future Research
Alwis, C. D., Kalla, A., Pham, Q.-V., Kumar, P., Dev, K., Hwang, W.-J., & Liyanage, M. (2021) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2021.3071496 · Cited by 788
Evolutionary V2X Technologies Toward the Internet of Vehicles: Challenges and Opportunities
Zhou, H., Xu, W., Chen, J., & Wang, W. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2961937 · Cited by 655
Internet of vehicles in big data era
Xu, W., Zhou, H., Cheng, N., Lyu, F., Shi, W., Chen, J., & Shen, X. (2018) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2017.7510736 · Cited by 565
Named Data Networking in Vehicular Ad Hoc Networks: State-of-the-Art and Challenges
Khelifi, H., Luo, S., Nour, B., Moungla, H., Faheem, Y., Hussain, R., & Ksentini, A. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2894816 · Cited by 346
A Systematic Review of Hidden Markov Models and Their Applications
Mor, B., Garhwal, S., & Kumar, A. (2021) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-020-09422-4 · Cited by 343
Bus-Trajectory-Based Street-Centric Routing for Message Delivery in Urban Vehicular Ad Hoc Networks
Sun, G., Zhang, Y., Liao, D., Yu, H., Du, X., & Guizani, M. (2018) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2018.2828651 · Cited by 270
Qayyum, A., Usama, M., Qadir, J., & Al-Fuqaha, A. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2975048 · Cited by 257
“g four major components (as shown in Figure 8). 10 TABLE III: Overview of machine learning (ML)-based research on different vehicular network’s applications Authors Application Methodology Yao et al. [62] Location prediction based scheduling and routing Hidden Markov models Xue et al. [63] Variable-order Markov models…”
BackgroundModeling Quality of IoT Experience in Autonomous Vehicles
Minovski, D., Ahlund, C., & Mitra, K. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2975418 · Cited by 59
“…deep RL, Markov models, and clustering methods to address other network-related issues, such as location prediction-based scheduling and routing [81], load balancing and vertical handoff control [82], virtual resource allocation [83], and estimating latency during drive tests [47]. c) Role of…”
BackgroundZhuang, L., Guo, N., & Chen, Y. (2023) · Sensors · doi:10.3390/s23031164 · Cited by 10
“The CF is a compact variant of the Cuckoo hash table; it stores only fingerprints (using the hash function derived from inserting each item as a string) rather than a key-value pair [23].”
Background
Metadata
- Authors
- Yao, L., Wang, J., Wang, X., Chen, A., & Wang, Y.
- Venue
- IEEE Transactions on Intelligent Transportation Systems
- Published
- 2018-03
- Volume
- 19
- Issue
- 3
- Pages
- 889-899
- ISSN
- 1524-9050 (ISSN-L)
- 1558-0016
- OpenAlex
- W2702886553
- Cited by
- 102
- References
- 0
- FWCI
- 4.48
- 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
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.