为VANETs提供的合作定位服务

Tawfiq Nebbou, H. Fouchal, M. Lehsaini, Marwane Ayaida
{"title":"为VANETs提供的合作定位服务","authors":"Tawfiq Nebbou, H. Fouchal, M. Lehsaini, Marwane Ayaida","doi":"10.1109/ISCC.2017.8024504","DOIUrl":null,"url":null,"abstract":"Routing messages over vehicular ad hoc networks (VANETs) is usually achieved through geographic routing protocols. In such networks, the vehicle dynamics causes rapid changes on the vehicle density and the communication links. In order to be efficient to route messages from a vehicle to another, we need to locate each node (its position), this is achieved by a location service. This study works on simple location service adapted for unicast routing over VANETs in city environment. This service is able to find a route from a route from a source to the destination and this route is the one passing through the most dense path‥ We have implemented our proposal on the OMNET++ simulator and we have conducted extensive simulations in different scenarios to evaluate its scalability and robustness against frequent topology changes. The results obtained have shown that our proposed protocol provides significant improvements in terms of packet delivery ratio, end-to-end delay and overhead compared to EGyTAR protocol.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A cooperative location service for VANETs\",\"authors\":\"Tawfiq Nebbou, H. Fouchal, M. Lehsaini, Marwane Ayaida\",\"doi\":\"10.1109/ISCC.2017.8024504\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Routing messages over vehicular ad hoc networks (VANETs) is usually achieved through geographic routing protocols. In such networks, the vehicle dynamics causes rapid changes on the vehicle density and the communication links. In order to be efficient to route messages from a vehicle to another, we need to locate each node (its position), this is achieved by a location service. This study works on simple location service adapted for unicast routing over VANETs in city environment. This service is able to find a route from a route from a source to the destination and this route is the one passing through the most dense path‥ We have implemented our proposal on the OMNET++ simulator and we have conducted extensive simulations in different scenarios to evaluate its scalability and robustness against frequent topology changes. The results obtained have shown that our proposed protocol provides significant improvements in terms of packet delivery ratio, end-to-end delay and overhead compared to EGyTAR protocol.\",\"PeriodicalId\":106141,\"journal\":{\"name\":\"2017 IEEE Symposium on Computers and Communications (ISCC)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE Symposium on Computers and Communications (ISCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCC.2017.8024504\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Symposium on Computers and Communications (ISCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC.2017.8024504","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

车辆自组织网络(vanet)上的路由消息通常通过地理路由协议实现。在这种网络中,车辆的动态变化会导致车辆密度和通信链路的快速变化。为了有效地将消息从一辆车路由到另一辆车,我们需要定位每个节点(它的位置),这是通过位置服务实现的。本文研究了适合城市环境下vanet单播路由的简单位置服务。这个服务能够从一个从源到目的地的路由找到一条路由,这条路由是通过最密集的路径的路由。我们已经在omnet++模拟器上实现了我们的提议,我们已经在不同的场景中进行了广泛的模拟,以评估其可扩展性和鲁棒性,以应对频繁的拓扑变化。结果表明,与EGyTAR协议相比,我们提出的协议在分组传输比、端到端延迟和开销方面有了显著的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A cooperative location service for VANETs
Routing messages over vehicular ad hoc networks (VANETs) is usually achieved through geographic routing protocols. In such networks, the vehicle dynamics causes rapid changes on the vehicle density and the communication links. In order to be efficient to route messages from a vehicle to another, we need to locate each node (its position), this is achieved by a location service. This study works on simple location service adapted for unicast routing over VANETs in city environment. This service is able to find a route from a route from a source to the destination and this route is the one passing through the most dense path‥ We have implemented our proposal on the OMNET++ simulator and we have conducted extensive simulations in different scenarios to evaluate its scalability and robustness against frequent topology changes. The results obtained have shown that our proposed protocol provides significant improvements in terms of packet delivery ratio, end-to-end delay and overhead compared to EGyTAR protocol.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Uncertainty-driven ensemble forecasting of QoS in Software Defined Networks A Reactive Security Framework for operational wind parks using Service Function Chaining The use of predictive models in dynamic treatment planning Link quality and path based clustering in IEEE 802.15.4-2015 TSCH networks Using repeated game for maximizing high priority data trustworthiness in Wireless Sensor Networks
×
引用
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