曼谷场景中协同开花过滤器辅助查询协议的数据访问性能

Kiattikun Kawila, K. Rojviboonchai
{"title":"曼谷场景中协同开花过滤器辅助查询协议的数据访问性能","authors":"Kiattikun Kawila, K. Rojviboonchai","doi":"10.1109/JCSSE.2014.6841866","DOIUrl":null,"url":null,"abstract":"Vehicular ad hoc network (VANET) is challenging to deliver a query message for a requesting data efficiently when the topology of network keeps changing frequently and has many partitions. Many routing algorithms suffer from path breaks. Our work focuses on communication between vehicles to roadside unit stations by requesting data only one-hop communication from the requesting node. Routing algorithms are not needed to create data transfer path. We present a cooperative-bloom filter-assisted query protocol for data access in VANET, COBRA-Q. The COBRA-Q utilizes the movement of vehicles to achieve transfer of the request data within one-hop communication. The COBRA-Q uses bloom filter technique to keep and compress car traveling history records. In this paper, we evaluate the performance of our proposed protocol by simulation in ns-3. The real vehicle density and the real urban area in Bangkok are used. The simulation results show that the COBRA-Q can effectively access data in terms of percentage of success rate and overhead of using query message.","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Performance of a cooperative-bloom filter-assisted query protocol for data access in Bangkok scenario\",\"authors\":\"Kiattikun Kawila, K. Rojviboonchai\",\"doi\":\"10.1109/JCSSE.2014.6841866\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vehicular ad hoc network (VANET) is challenging to deliver a query message for a requesting data efficiently when the topology of network keeps changing frequently and has many partitions. Many routing algorithms suffer from path breaks. Our work focuses on communication between vehicles to roadside unit stations by requesting data only one-hop communication from the requesting node. Routing algorithms are not needed to create data transfer path. We present a cooperative-bloom filter-assisted query protocol for data access in VANET, COBRA-Q. The COBRA-Q utilizes the movement of vehicles to achieve transfer of the request data within one-hop communication. The COBRA-Q uses bloom filter technique to keep and compress car traveling history records. In this paper, we evaluate the performance of our proposed protocol by simulation in ns-3. The real vehicle density and the real urban area in Bangkok are used. The simulation results show that the COBRA-Q can effectively access data in terms of percentage of success rate and overhead of using query message.\",\"PeriodicalId\":331610,\"journal\":{\"name\":\"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/JCSSE.2014.6841866\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCSSE.2014.6841866","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

车辆自组织网络(VANET)在网络拓扑结构频繁变化且分区众多的情况下,如何有效地为请求数据传递查询消息是一个挑战。许多路由算法都有路径中断的问题。我们的工作重点是车辆与路边单元站之间的通信,通过从请求节点请求数据的单跳通信。创建数据传输路径不需要路由算法。提出了一种基于协同开花过滤器的VANET - COBRA-Q数据访问查询协议。COBRA-Q利用车辆的移动在单跳通信中实现请求数据的传输。COBRA-Q使用bloom过滤器技术来保存和压缩汽车旅行历史记录。在本文中,我们通过ns-3中的仿真来评估我们提出的协议的性能。使用的是曼谷真实的车辆密度和真实的城市面积。仿真结果表明,从查询消息使用的成功率百分比和开销来看,COBRA-Q能够有效地访问数据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Performance of a cooperative-bloom filter-assisted query protocol for data access in Bangkok scenario
Vehicular ad hoc network (VANET) is challenging to deliver a query message for a requesting data efficiently when the topology of network keeps changing frequently and has many partitions. Many routing algorithms suffer from path breaks. Our work focuses on communication between vehicles to roadside unit stations by requesting data only one-hop communication from the requesting node. Routing algorithms are not needed to create data transfer path. We present a cooperative-bloom filter-assisted query protocol for data access in VANET, COBRA-Q. The COBRA-Q utilizes the movement of vehicles to achieve transfer of the request data within one-hop communication. The COBRA-Q uses bloom filter technique to keep and compress car traveling history records. In this paper, we evaluate the performance of our proposed protocol by simulation in ns-3. The real vehicle density and the real urban area in Bangkok are used. The simulation results show that the COBRA-Q can effectively access data in terms of percentage of success rate and overhead of using query message.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信