Keep Forwarding Path Freshest in VANET via Applying Reinforcement Learning

Xuefeng Ji, Wenquan Xu, Chuwen Zhang, Tong Yun, Gong Zhang, Xiaojun Wang, Yunsheng Wang, B. Liu
{"title":"Keep Forwarding Path Freshest in VANET via Applying Reinforcement Learning","authors":"Xuefeng Ji, Wenquan Xu, Chuwen Zhang, Tong Yun, Gong Zhang, Xiaojun Wang, Yunsheng Wang, B. Liu","doi":"10.1109/NMIC.2019.00008","DOIUrl":null,"url":null,"abstract":"In Vehicular Ad Hoc NETworks (VANET), dynamic topology changes of network and inconstant bandwidth make it hard to maintain an end-to-end path to complete long-time stable data transmission. Facing this challenge, researchers have proposed the hybrid routing approach, which tries to combine both the advantages of recalculating route when topology changes and looking up routing table as long as the network topology is relatively stable. However, the existing hybrid routing algorithms can easily cause the blind path problem, meaning a route entry is kept in the routing table without expiration according to the timeout mechanism but it is actually invalid, because the next hop is already unavailable. To address this issue, we propose a Reinforcement learning based Hybrid Routing algorithm (RHR) that can online track the available paths with their status and use packet-carry-on information as real-time feedback to guide routing. RHR keeps the forwarding path always the freshest and thus improves the system performance. Simulation results show that RHR achieves better performance in packet delivery ratio (PDR), roundtrip time (RTT) and overhead than other peers under different scenarios of network scale, request frequency and vehicle velocity.","PeriodicalId":170708,"journal":{"name":"2019 IEEE First International Workshop on Network Meets Intelligent Computations (NMIC)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE First International Workshop on Network Meets Intelligent Computations (NMIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NMIC.2019.00008","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

In Vehicular Ad Hoc NETworks (VANET), dynamic topology changes of network and inconstant bandwidth make it hard to maintain an end-to-end path to complete long-time stable data transmission. Facing this challenge, researchers have proposed the hybrid routing approach, which tries to combine both the advantages of recalculating route when topology changes and looking up routing table as long as the network topology is relatively stable. However, the existing hybrid routing algorithms can easily cause the blind path problem, meaning a route entry is kept in the routing table without expiration according to the timeout mechanism but it is actually invalid, because the next hop is already unavailable. To address this issue, we propose a Reinforcement learning based Hybrid Routing algorithm (RHR) that can online track the available paths with their status and use packet-carry-on information as real-time feedback to guide routing. RHR keeps the forwarding path always the freshest and thus improves the system performance. Simulation results show that RHR achieves better performance in packet delivery ratio (PDR), roundtrip time (RTT) and overhead than other peers under different scenarios of network scale, request frequency and vehicle velocity.
通过应用强化学习使VANET中的转发路径保持最新状态
在车载自组织网络(VANET)中,由于网络拓扑的动态变化和带宽的不稳定,很难维持端到端的路径来完成长时间稳定的数据传输。面对这一挑战,研究人员提出了混合路由方法,该方法试图结合拓扑变化时重新计算路由和在网络拓扑相对稳定的情况下查找路由表的优点。但是,现有的混合路由算法很容易造成盲路由问题,即路由条目根据超时机制保留在路由表中而没有过期,但实际上是无效的,因为下一跳已经不可用。为了解决这个问题,我们提出了一种基于强化学习的混合路由算法(RHR),该算法可以在线跟踪可用路径及其状态,并使用包携带信息作为实时反馈来指导路由。RHR使转发路径始终是最新的,从而提高了系统性能。仿真结果表明,在网络规模、请求频率和车速等不同场景下,RHR在包投递率(PDR)、往返时间(RTT)和开销方面都优于其他对等体。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信