城市车辆自组织网络的多跳路由协议

Zhaomin Mo, Hao Zhu, K. Makki, N. Pissinou
{"title":"城市车辆自组织网络的多跳路由协议","authors":"Zhaomin Mo, Hao Zhu, K. Makki, N. Pissinou","doi":"10.1109/MOBIQ.2006.340406","DOIUrl":null,"url":null,"abstract":"Vehicular ad hoc networks (VANETs) are going to be an important communication infrastructure in our life. Because of high mobility and frequent link disconnection, it becomes quite challenging to establish a robust multi-hop path that helps packet delivery from the source to the destination. This paper presents a multi-hop routing protocol, called MURU that is able to find robust paths in urban VANETs to achieve high end-to-end packet delivery ratio with low overhead. MURU tries to minimize the probability of path breakage by exploiting mobility information of each vehicle in VANETs. A new metric called expected disconnection degree (EDD) is used to select the most robust path from the source to the destination. MURU is fully distributed and does not incur much overhead, which makes MURU highly scalable for VANETs. The design is sufficiently justified through theoretical analysis and the protocol is evaluated with extensive simulations. Simulation results demonstrate that MURU significantly outperforms existing ad hoc routing protocols in terms of packet delivery ratio, packet delay and control overhead","PeriodicalId":440604,"journal":{"name":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"150","resultStr":"{\"title\":\"MURU: A Multi-Hop Routing Protocol for Urban Vehicular Ad Hoc Networks\",\"authors\":\"Zhaomin Mo, Hao Zhu, K. Makki, N. Pissinou\",\"doi\":\"10.1109/MOBIQ.2006.340406\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vehicular ad hoc networks (VANETs) are going to be an important communication infrastructure in our life. Because of high mobility and frequent link disconnection, it becomes quite challenging to establish a robust multi-hop path that helps packet delivery from the source to the destination. This paper presents a multi-hop routing protocol, called MURU that is able to find robust paths in urban VANETs to achieve high end-to-end packet delivery ratio with low overhead. MURU tries to minimize the probability of path breakage by exploiting mobility information of each vehicle in VANETs. A new metric called expected disconnection degree (EDD) is used to select the most robust path from the source to the destination. MURU is fully distributed and does not incur much overhead, which makes MURU highly scalable for VANETs. The design is sufficiently justified through theoretical analysis and the protocol is evaluated with extensive simulations. Simulation results demonstrate that MURU significantly outperforms existing ad hoc routing protocols in terms of packet delivery ratio, packet delay and control overhead\",\"PeriodicalId\":440604,\"journal\":{\"name\":\"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"150\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MOBIQ.2006.340406\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MOBIQ.2006.340406","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 150

摘要

车载自组织网络(vanet)将成为我们生活中重要的通信基础设施。由于高移动性和频繁的链路断开,建立一个健壮的多跳路径来帮助数据包从源发送到目的地变得非常具有挑战性。本文提出了一种多跳路由协议,称为MURU,它能够在城市vanet中找到鲁棒路径,以低开销实现高端到端分组传输比。MURU试图通过利用VANETs中每辆车的移动信息来最小化路径破坏的概率。该方法采用了一种新的度量,称为期望断开度(EDD),用于选择从源到目的的最稳健路径。MURU是完全分布式的,不会产生太多的开销,这使得MURU在vanet上具有很高的可扩展性。通过理论分析充分证明了该设计的合理性,并通过大量的仿真对该协议进行了评估。仿真结果表明,MURU在分组传送率、分组延迟和控制开销方面明显优于现有的自组织路由协议
本文章由计算机程序翻译,如有差异,请以英文原文为准。
MURU: A Multi-Hop Routing Protocol for Urban Vehicular Ad Hoc Networks
Vehicular ad hoc networks (VANETs) are going to be an important communication infrastructure in our life. Because of high mobility and frequent link disconnection, it becomes quite challenging to establish a robust multi-hop path that helps packet delivery from the source to the destination. This paper presents a multi-hop routing protocol, called MURU that is able to find robust paths in urban VANETs to achieve high end-to-end packet delivery ratio with low overhead. MURU tries to minimize the probability of path breakage by exploiting mobility information of each vehicle in VANETs. A new metric called expected disconnection degree (EDD) is used to select the most robust path from the source to the destination. MURU is fully distributed and does not incur much overhead, which makes MURU highly scalable for VANETs. The design is sufficiently justified through theoretical analysis and the protocol is evaluated with extensive simulations. Simulation results demonstrate that MURU significantly outperforms existing ad hoc routing protocols in terms of packet delivery ratio, packet delay and control overhead
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信