TY - JOUR
T1 - Towards Predictive Forwarding Strategy in Vehicular Named Data Networking
AU - Wang, Junxia
AU - Luo, Jiangtao
AU - Ran, Yongyi
AU - Yang, Junchao
AU - Liu, Kai
AU - Guo, Song
N1 - Publisher Copyright:
© 1967-2012 IEEE.
PY - 2023/3/1
Y1 - 2023/3/1
N2 - Vehicular named data networking (V-NDN) is promising to improve the content delivery efficiency in vehicular ad hoc networks (VANETs). However, the potential broadcast storm caused by Interest packet flooding and return path failures caused by vehicle mobility can significantly degrade the content delivery performance. Existing forwarding strategies based on outdated position information cannot address these issues well. In this paper, we propose a novel predictive forwarding strategy (PRFS) for V-NDN. In PRFS, long short-term memory (LSTM) is employed to amend the neighbor table (NBT) for preciser neighboring vehicles' positions. In addition, the next-hop forwarder is selected among the neighbors, taking into account the link reliability and the distance along the road (DR) in both directions. Furthermore, a new mechanism is designed to notify the selected next-hop forwarder by embedding the forwarder identity in the Interest packet header, so as to accelerate the forwarding process. Finally, extensive simulations are carried out, and experimental results demonstrate that PRFS can reduce the number of forwarded Interest packets and data packets by 21.29% and 25.75%, respectively, and improve the success ratio of satisfied Interest packets by 35.1% compared to the existing baseline algorithms.
AB - Vehicular named data networking (V-NDN) is promising to improve the content delivery efficiency in vehicular ad hoc networks (VANETs). However, the potential broadcast storm caused by Interest packet flooding and return path failures caused by vehicle mobility can significantly degrade the content delivery performance. Existing forwarding strategies based on outdated position information cannot address these issues well. In this paper, we propose a novel predictive forwarding strategy (PRFS) for V-NDN. In PRFS, long short-term memory (LSTM) is employed to amend the neighbor table (NBT) for preciser neighboring vehicles' positions. In addition, the next-hop forwarder is selected among the neighbors, taking into account the link reliability and the distance along the road (DR) in both directions. Furthermore, a new mechanism is designed to notify the selected next-hop forwarder by embedding the forwarder identity in the Interest packet header, so as to accelerate the forwarding process. Finally, extensive simulations are carried out, and experimental results demonstrate that PRFS can reduce the number of forwarded Interest packets and data packets by 21.29% and 25.75%, respectively, and improve the success ratio of satisfied Interest packets by 35.1% compared to the existing baseline algorithms.
KW - LSTM
KW - Vehicular ad hoc network
KW - data forwarding
KW - named data networking
UR - https://www.webofscience.com/wos/woscc/full-record/WOS:000966286200001
UR - https://openalex.org/W4297094594
UR - https://www.scopus.com/pages/publications/85139498367
U2 - 10.1109/TVT.2022.3209539
DO - 10.1109/TVT.2022.3209539
M3 - Journal Article
SN - 0018-9545
VL - 72
SP - 3751
EP - 3763
JO - IEEE Transactions on Vehicular Technology
JF - IEEE Transactions on Vehicular Technology
IS - 3
ER -