A multi-hop broadcast routing algorithm based on real-time traffic estimation for VANETs

Fan Zhang, T. Luo, Jianfeng Li
{"title":"A multi-hop broadcast routing algorithm based on real-time traffic estimation for VANETs","authors":"Fan Zhang, T. Luo, Jianfeng Li","doi":"10.1109/ICT.2015.7124671","DOIUrl":null,"url":null,"abstract":"In this paper, we propose an efficient multi-hop broadcast routing algorithm based on Real-time Traffic Estimation in vehicular ad-hoc networks (VANETs) including a novel relay node selection scheme and an efficient adaptive rebroadcast wait delay strategy. Firstly, we take the overall traffic information into consideration to select the relay node, which is different with the traditional scheme only considering the distance information. In order to obtain more accurate traffic information in the target road segment, we employ the real-time traffic estimates algorithm to predict the information. Furthermore, we also reduce the rebroadcast waiting just select only one rebroadcast node by considering many influence factors such as the traffic density and the vehicle information. Therefore, a weighted utility function (WUF) is formulated to comprehensively consider the effect of these factors. Furthermore, the value of WUF can also be utilized to determine the waiting time of the rebroadcast node to achieve the adaptive wait scheme. Finally, the timeout retransmission strategy is employed to improve the reliability of broadcast message transmission at the source node. Theoretical and simulation results demonstrate the effectiveness of the proposed algorithm in terms of the packet delay, data redundancy, effective permeability and network robustness, when compared with classical M-Flood and Slotted algorithms.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 22nd International Conference on Telecommunications (ICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICT.2015.7124671","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, we propose an efficient multi-hop broadcast routing algorithm based on Real-time Traffic Estimation in vehicular ad-hoc networks (VANETs) including a novel relay node selection scheme and an efficient adaptive rebroadcast wait delay strategy. Firstly, we take the overall traffic information into consideration to select the relay node, which is different with the traditional scheme only considering the distance information. In order to obtain more accurate traffic information in the target road segment, we employ the real-time traffic estimates algorithm to predict the information. Furthermore, we also reduce the rebroadcast waiting just select only one rebroadcast node by considering many influence factors such as the traffic density and the vehicle information. Therefore, a weighted utility function (WUF) is formulated to comprehensively consider the effect of these factors. Furthermore, the value of WUF can also be utilized to determine the waiting time of the rebroadcast node to achieve the adaptive wait scheme. Finally, the timeout retransmission strategy is employed to improve the reliability of broadcast message transmission at the source node. Theoretical and simulation results demonstrate the effectiveness of the proposed algorithm in terms of the packet delay, data redundancy, effective permeability and network robustness, when compared with classical M-Flood and Slotted algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于实时流量估计的VANETs多跳广播路由算法
本文提出了一种基于实时流量估计的高效多跳广播路由算法,该算法包括一种新的中继节点选择方案和一种高效的自适应重播等待延迟策略。首先,与传统的仅考虑距离信息的中继节点选择方案不同,该方案考虑了整体的交通信息来选择中继节点。为了获得目标路段更准确的交通信息,我们采用实时交通估计算法对信息进行预测。此外,在考虑交通密度、车辆信息等多种影响因素的情况下,只选取一个重播节点,减少了重播等待时间。因此,我们建立了加权效用函数(WUF)来综合考虑这些因素的影响。此外,还可以利用WUF的值来确定重播节点的等待时间,从而实现自适应等待方案。最后,采用超时重传策略提高源节点广播消息传输的可靠性。理论和仿真结果表明,与经典的M-Flood和Slotted算法相比,该算法在数据包延迟、数据冗余、有效渗透率和网络鲁棒性等方面都是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Artificial neural network-based nonlinear channel equalization: A soft-output perspective Joint resource scheduling for full-duplex cellular system Spatial coupling of root-LDPC: Parity bits doping Simplified robust design for nonregenerativemm multicasting MIMO relay systems A tree-based regularized orthogonal matching pursuit algorithm
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1