Liang Zhao
A Novel Prediction-Based Temporal Graph Routing Algorithm for Software-Defined Vehicular Networks
Zhao, Liang; Li, Zhuhui; Al-Dubai, Ahmed; Min, Geyong; Li, Jiajia; Hawbani, Ammar; Zomaya, Albert
Authors
Zhuhui Li
Prof Ahmed Al-Dubai A.Al-Dubai@napier.ac.uk
Professor
Geyong Min
Jiajia Li
Ammar Hawbani
Albert Zomaya
Abstract
Temporal information is critical for routing computation in the vehicular network. It plays a vital role in the vehicular network. Till now, most existing routing schemes in vehicular networks consider the networks as a sequence of static graphs. We need to find an appropriate method to process temporal information into routing computation. Thus, in this paper, we propose a routing algorithm based on the Hidden Markov Model (HMM) and temporal graph, namely, PredictionBased Temporal Graph Routing Algorithm (PT-GROUT). This new algorithm considers the vehicular network as a temporal graph, in which each data transmission as an edge has its specific temporal information. To better capture the temporal information, we select Software-Defined Vehicular Network (SDVN) as our network architecture, which is a preferred architecture for processing the temporal graph regarding the vehicular network since all vehicle statuses can be easily managed. To compute the future routing path accurately and efficiently, the future temporal graph is predicted by applying HMM, in which we model the current vehicular network with dynamic programming and greedy strategies. With the temporal information and reasonable setting of HMM, PT-GROUT can better evaluate the vehicular network and discover the evolution of the internal structure of the network. The optimal routing path can be achieved more efficiently. The simulation results demonstrate that PT-GROUT can substantially improve the computation efficiency and reduce packet loss and delivery delay compared with its counterparts.
Citation
Zhao, L., Li, Z., Al-Dubai, A., Min, G., Li, J., Hawbani, A., & Zomaya, A. (2022). A Novel Prediction-Based Temporal Graph Routing Algorithm for Software-Defined Vehicular Networks. IEEE Transactions on Intelligent Transportation Systems, 23(8), 13275-13290. https://doi.org/10.1109/TITS.2021.3123276
Journal Article Type | Article |
---|---|
Acceptance Date | Oct 21, 2021 |
Online Publication Date | Nov 13, 2021 |
Publication Date | 2022-08 |
Deposit Date | Oct 23, 2021 |
Publicly Available Date | Nov 13, 2021 |
Journal | IEEE Transactions on Intelligent Transportation Systems |
Print ISSN | 1524-9050 |
Electronic ISSN | 1558-0016 |
Publisher | Institute of Electrical and Electronics Engineers |
Peer Reviewed | Peer Reviewed |
Volume | 23 |
Issue | 8 |
Pages | 13275-13290 |
DOI | https://doi.org/10.1109/TITS.2021.3123276 |
Keywords | vehicular ad hoc networks, routing, software-defined vehicular networks, hidden markov model, temporal graph |
Public URL | http://researchrepository.napier.ac.uk/Output/2815790 |
Files
A Novel Prediction-Based Temporal Graph Routing Algorithm For Software-Defined Vehicular Networks (accepted version)
(7 Mb)
PDF
You might also like
Chaotic Quantum Encryption to Secure Image Data in Post Quantum Consumer Technology
(2024)
Journal Article
Adaptive Mobile Chargers Scheduling Scheme based on AHP-MCDM for WRSN
(2024)
Journal Article
Wireless Power Transfer Technologies, Applications, and Future Trends: A Review
(2024)
Journal Article
Downloadable Citations
About Edinburgh Napier Research Repository
Administrator e-mail: repository@napier.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search