城市场景中VANET的可达性

Jiujun Cheng, Lu-Xing Yang, Guangtao Zhou, Hongjiang Zheng, Shuai Feng, Jie Cui, Zhenhua Huang
{"title":"城市场景中VANET的可达性","authors":"Jiujun Cheng, Lu-Xing Yang, Guangtao Zhou, Hongjiang Zheng, Shuai Feng, Jie Cui, Zhenhua Huang","doi":"10.1109/ICNSC52481.2021.9702242","DOIUrl":null,"url":null,"abstract":"Maintaining Vehicular Ad-hoc NETwork (VANET) accessibility is a thorny challenge in an urban scene. Existing methods assume that VANET obeys the ideal distribution, and do not consider the difference of connectivity between vehicles and vehicle groups. This work models VANET accessibility globally or locally. First, it measures connectivity between two vehicles. Then, it defines four connected states of paths and removes redundant connections. Finally, it proposes a path connectivity delay calculation method and a transfer station selection algorithm. Simulation results show that our method can evaluate VANET accessibility effectively and has a shorter averaged delay and higher packet delivery rate than a greedy perimeter stateless routing algorithm.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"85 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Accessibility for VANET in an Urban Scene\",\"authors\":\"Jiujun Cheng, Lu-Xing Yang, Guangtao Zhou, Hongjiang Zheng, Shuai Feng, Jie Cui, Zhenhua Huang\",\"doi\":\"10.1109/ICNSC52481.2021.9702242\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Maintaining Vehicular Ad-hoc NETwork (VANET) accessibility is a thorny challenge in an urban scene. Existing methods assume that VANET obeys the ideal distribution, and do not consider the difference of connectivity between vehicles and vehicle groups. This work models VANET accessibility globally or locally. First, it measures connectivity between two vehicles. Then, it defines four connected states of paths and removes redundant connections. Finally, it proposes a path connectivity delay calculation method and a transfer station selection algorithm. Simulation results show that our method can evaluate VANET accessibility effectively and has a shorter averaged delay and higher packet delivery rate than a greedy perimeter stateless routing algorithm.\",\"PeriodicalId\":129062,\"journal\":{\"name\":\"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)\",\"volume\":\"85 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNSC52481.2021.9702242\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNSC52481.2021.9702242","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在城市场景中,维护车辆自组织网络(VANET)的可达性是一个棘手的挑战。现有方法假设VANET服从理想分布,没有考虑车辆和车辆组之间的连通性差异。这项工作对VANET的可访问性进行了全局或局部建模。首先,它测量两辆车之间的连通性。然后,定义路径的四种连接状态,并去除冗余连接。最后,提出了一种路径连接延迟计算方法和中转站选择算法。仿真结果表明,该方法能够有效地评估VANET的可达性,并且比贪婪周长无状态路由算法具有更短的平均延迟和更高的数据包投递率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Accessibility for VANET in an Urban Scene
Maintaining Vehicular Ad-hoc NETwork (VANET) accessibility is a thorny challenge in an urban scene. Existing methods assume that VANET obeys the ideal distribution, and do not consider the difference of connectivity between vehicles and vehicle groups. This work models VANET accessibility globally or locally. First, it measures connectivity between two vehicles. Then, it defines four connected states of paths and removes redundant connections. Finally, it proposes a path connectivity delay calculation method and a transfer station selection algorithm. Simulation results show that our method can evaluate VANET accessibility effectively and has a shorter averaged delay and higher packet delivery rate than a greedy perimeter stateless routing algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信