基于Voronoi图的车载广播道路地图分析

Ryozo Yanagida, Keiji Obara, Koki Ogawa, H. Shigeno
{"title":"基于Voronoi图的车载广播道路地图分析","authors":"Ryozo Yanagida, Keiji Obara, Koki Ogawa, H. Shigeno","doi":"10.1109/BWCCA.2015.8","DOIUrl":null,"url":null,"abstract":"In Vehicular Ad-hoc Networks, a method of message dissemination is broadcast. It is a method of message dissemination by relaying messages between vehicles. In broadcast, vehicles cause the broadcast storm problem because of redundant relays. Thus, it is necessary to control redundant relays by broadcast protocols. Many broadcast protocols have been developed and they can disseminate with suppressing redundant relays. However, the packet reception ratio and its overhead depend on not only broadcast protocols, but also structures of road maps. Thus, it is necessary to research some relationships between radio propagation features and structures of road maps. In this paper, we propose a method of analyzing complexities of road maps. It is named Analysis Road map Complexity by Deviation of intersection distribution (ARC-DID). It focus on that there is a relationship between radio propagation features and places of intersections. Hence, we propose an analysis method of complexities of road maps based on intersection distribution. In order to analyze complexities of road maps based on a deviation of intersections, we use a Voronoi diagram. According to this method, we can analyze complexities of road maps quantitatively. In order to show utility of complexities calculated by proposed method, we execute a broadcast simulation with three parameters. According to the simulation, complexities calculated by ARC-DID can set parameters which adapt to road maps.","PeriodicalId":193597,"journal":{"name":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An Analysis of Road Maps Based on Voronoi Diagram for Vehicular Broadcast\",\"authors\":\"Ryozo Yanagida, Keiji Obara, Koki Ogawa, H. Shigeno\",\"doi\":\"10.1109/BWCCA.2015.8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In Vehicular Ad-hoc Networks, a method of message dissemination is broadcast. It is a method of message dissemination by relaying messages between vehicles. In broadcast, vehicles cause the broadcast storm problem because of redundant relays. Thus, it is necessary to control redundant relays by broadcast protocols. Many broadcast protocols have been developed and they can disseminate with suppressing redundant relays. However, the packet reception ratio and its overhead depend on not only broadcast protocols, but also structures of road maps. Thus, it is necessary to research some relationships between radio propagation features and structures of road maps. In this paper, we propose a method of analyzing complexities of road maps. It is named Analysis Road map Complexity by Deviation of intersection distribution (ARC-DID). It focus on that there is a relationship between radio propagation features and places of intersections. Hence, we propose an analysis method of complexities of road maps based on intersection distribution. In order to analyze complexities of road maps based on a deviation of intersections, we use a Voronoi diagram. According to this method, we can analyze complexities of road maps quantitatively. In order to show utility of complexities calculated by proposed method, we execute a broadcast simulation with three parameters. According to the simulation, complexities calculated by ARC-DID can set parameters which adapt to road maps.\",\"PeriodicalId\":193597,\"journal\":{\"name\":\"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BWCCA.2015.8\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BWCCA.2015.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

在车载自组织网络中,一种消息传播方法是广播。它是一种通过在车辆之间传递消息来传播消息的方法。在广播中,车辆由于中继冗余而引起广播风暴问题。因此,有必要通过广播协议来控制冗余中继。已经开发了许多广播协议,它们可以通过抑制冗余中继进行传播。然而,数据包接收率及其开销不仅与广播协议有关,还与路线图的结构有关。因此,有必要研究无线电传播特征与道路地图结构之间的关系。在本文中,我们提出了一种分析道路地图复杂性的方法。该方法被命名为ARC-DID (Analysis Road map Complexity by Deviation of intersection distribution)。重点分析了交叉口位置与无线电传播特征之间的关系。因此,我们提出了一种基于交叉口分布的道路地图复杂性分析方法。为了分析基于交叉口偏差的道路地图的复杂性,我们使用了Voronoi图。根据这种方法,我们可以定量地分析道路地图的复杂性。为了证明该方法计算复杂性的有效性,我们进行了一个具有三个参数的广播仿真。仿真结果表明,ARC-DID计算出的复杂性可以设置适应道路地图的参数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Analysis of Road Maps Based on Voronoi Diagram for Vehicular Broadcast
In Vehicular Ad-hoc Networks, a method of message dissemination is broadcast. It is a method of message dissemination by relaying messages between vehicles. In broadcast, vehicles cause the broadcast storm problem because of redundant relays. Thus, it is necessary to control redundant relays by broadcast protocols. Many broadcast protocols have been developed and they can disseminate with suppressing redundant relays. However, the packet reception ratio and its overhead depend on not only broadcast protocols, but also structures of road maps. Thus, it is necessary to research some relationships between radio propagation features and structures of road maps. In this paper, we propose a method of analyzing complexities of road maps. It is named Analysis Road map Complexity by Deviation of intersection distribution (ARC-DID). It focus on that there is a relationship between radio propagation features and places of intersections. Hence, we propose an analysis method of complexities of road maps based on intersection distribution. In order to analyze complexities of road maps based on a deviation of intersections, we use a Voronoi diagram. According to this method, we can analyze complexities of road maps quantitatively. In order to show utility of complexities calculated by proposed method, we execute a broadcast simulation with three parameters. According to the simulation, complexities calculated by ARC-DID can set parameters which adapt to road maps.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信