An improved routing metric based on link states for vehicular ad hoc networks

Liran Wang, Changle Li, Chunchun Zhao, Hang Lin
{"title":"An improved routing metric based on link states for vehicular ad hoc networks","authors":"Liran Wang, Changle Li, Chunchun Zhao, Hang Lin","doi":"10.1109/ICCCHINAW.2013.6670584","DOIUrl":null,"url":null,"abstract":"Greedy forwarding is widely adopted in geographic routing protocols for VANETs since it selects the neighbor that is geographically closer to the destination as the next hop and is considered efficient. Because of the highly dynamic network topology and various impairment of radio signal, the link chosen according to the greedy algorithm regardless of the link state is unstable to a large extent, and frequent retransmissions lead to a waste of the network bandwidth and longer end to end delay. To address the issue, the paper proposed a new routing metric called expected one-transmission advance (EOA) to select the next hop to construct the route. The EOA of a certain node means the expected advance that a packet can make towards the destination through one transmission if choose the node as the next hop. The node with largest EOA is chosen as the intermediate node. The EOA metric balances the efficiency and reliability of the routing. We evaluate the performance of EOA by simulation and the result demonstrates significant reductions of end to end delay and increases of throughput compared to the traditional geographic routing protocol using greedy forwarding.","PeriodicalId":121230,"journal":{"name":"2013 IEEE/CIC International Conference on Communications in China - Workshops (CIC/ICCC)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE/CIC International Conference on Communications in China - Workshops (CIC/ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCHINAW.2013.6670584","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Greedy forwarding is widely adopted in geographic routing protocols for VANETs since it selects the neighbor that is geographically closer to the destination as the next hop and is considered efficient. Because of the highly dynamic network topology and various impairment of radio signal, the link chosen according to the greedy algorithm regardless of the link state is unstable to a large extent, and frequent retransmissions lead to a waste of the network bandwidth and longer end to end delay. To address the issue, the paper proposed a new routing metric called expected one-transmission advance (EOA) to select the next hop to construct the route. The EOA of a certain node means the expected advance that a packet can make towards the destination through one transmission if choose the node as the next hop. The node with largest EOA is chosen as the intermediate node. The EOA metric balances the efficiency and reliability of the routing. We evaluate the performance of EOA by simulation and the result demonstrates significant reductions of end to end delay and increases of throughput compared to the traditional geographic routing protocol using greedy forwarding.
一种改进的基于链路状态的车辆自组织网络路由度量
贪婪转发在vanet的地理路由协议中被广泛采用,因为它选择地理上离目的地较近的邻居作为下一跳,被认为是高效的。由于网络拓扑的高度动态性和无线电信号的各种损伤,根据贪婪算法选择的链路在很大程度上是不稳定的,并且频繁的重传会导致网络带宽的浪费和端到端延迟的延长。为了解决这一问题,本文提出了一种新的路由度量,称为期望单传输提前(EOA),用于选择构建路由的下一跳。某一节点的EOA是指如果选择该节点作为下一跳,数据包经过一次传输到达目的地的预期距离。选择EOA最大的节点作为中间节点。EOA度量平衡了路由的效率和可靠性。我们通过仿真评估了EOA的性能,结果表明与使用贪婪转发的传统地理路由协议相比,EOA显著降低了端到端延迟并增加了吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信