车载Ad-hoc网络中一种高效的地理感知点对点资源发现与共享方案

C. Dow, Pei-Jung Lin, Yu-Hong Lee, Ya-Chen Lin, Shiow-Fen Hwang
{"title":"车载Ad-hoc网络中一种高效的地理感知点对点资源发现与共享方案","authors":"C. Dow, Pei-Jung Lin, Yu-Hong Lee, Ya-Chen Lin, Shiow-Fen Hwang","doi":"10.1504/IJAHUC.2013.058507","DOIUrl":null,"url":null,"abstract":"Vehicles may move at high speed in vehicular ad-hoc networks (VANETs) and the network topology changes arbitrarily as the nodes move. Vehicles may not find suitable resources because sharing information could quickly become obsolete or irrelevant resources. This paper proposes an efficient geo-aware Peer-to-Peer (P2P) search mechanism to enable resource discovery and sharing in VANETs. We propose discovery and sharing schemes based on the virtual backbone architecture, and then limit the data exchanging region to reduce unnecessary message transmissions. Because the resource node changes very fast, the coordinator must be set to maintain the local node of geographic information in the network. In this scheme, coordinators are established to store information and manage local resource information. In order to ensure dissemination performance, it must guarantee that vehicles possess enough resource pieces to allow efficient bartering. Furthermore, three kinds of piece selection mechanisms, including Nearest-First, Rarest-First, and In-Order are proposed to download resource pieces from other vehicles and to improve the dissemination efficiency. Experiment results demonstrate that our searching and sharing schemes are efficient and outperforms other schemes in terms of satisfactory ratio and download time.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"An Efficient Geo-aware Peer-to-Peer Resource Discovery and Sharing Scheme in Vehicular Ad-hoc Networks\",\"authors\":\"C. Dow, Pei-Jung Lin, Yu-Hong Lee, Ya-Chen Lin, Shiow-Fen Hwang\",\"doi\":\"10.1504/IJAHUC.2013.058507\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vehicles may move at high speed in vehicular ad-hoc networks (VANETs) and the network topology changes arbitrarily as the nodes move. Vehicles may not find suitable resources because sharing information could quickly become obsolete or irrelevant resources. This paper proposes an efficient geo-aware Peer-to-Peer (P2P) search mechanism to enable resource discovery and sharing in VANETs. We propose discovery and sharing schemes based on the virtual backbone architecture, and then limit the data exchanging region to reduce unnecessary message transmissions. Because the resource node changes very fast, the coordinator must be set to maintain the local node of geographic information in the network. In this scheme, coordinators are established to store information and manage local resource information. In order to ensure dissemination performance, it must guarantee that vehicles possess enough resource pieces to allow efficient bartering. Furthermore, three kinds of piece selection mechanisms, including Nearest-First, Rarest-First, and In-Order are proposed to download resource pieces from other vehicles and to improve the dissemination efficiency. Experiment results demonstrate that our searching and sharing schemes are efficient and outperforms other schemes in terms of satisfactory ratio and download time.\",\"PeriodicalId\":117236,\"journal\":{\"name\":\"2012 Ninth International Conference on Information Technology - New Generations\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-04-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Ninth International Conference on Information Technology - New Generations\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJAHUC.2013.058507\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Ninth International Conference on Information Technology - New Generations","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJAHUC.2013.058507","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

在车辆自组织网络(vanet)中,车辆可能高速移动,网络拓扑结构随节点的移动而任意变化。车辆可能找不到合适的资源,因为共享信息可能很快成为过时或不相关的资源。本文提出了一种高效的地理感知点对点(P2P)搜索机制,以实现vanet中的资源发现和共享。我们提出了基于虚拟骨干网架构的发现和共享方案,然后限制数据交换区域以减少不必要的消息传输。由于资源节点变化非常快,必须设置协调器来维护网络中地理信息的本地节点。在该方案中,通过建立协调器来存储信息和管理本地资源信息。为了保证传播效果,必须保证车辆拥有足够的资源块,以便进行有效的物物交换。在此基础上,提出了Nearest-First、Rarest-First和In-Order三种资源片段选择机制,用于从其他车辆上下载资源片段,提高传播效率。实验结果表明,我们的搜索和共享方案是有效的,在满意率和下载时间方面优于其他方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Efficient Geo-aware Peer-to-Peer Resource Discovery and Sharing Scheme in Vehicular Ad-hoc Networks
Vehicles may move at high speed in vehicular ad-hoc networks (VANETs) and the network topology changes arbitrarily as the nodes move. Vehicles may not find suitable resources because sharing information could quickly become obsolete or irrelevant resources. This paper proposes an efficient geo-aware Peer-to-Peer (P2P) search mechanism to enable resource discovery and sharing in VANETs. We propose discovery and sharing schemes based on the virtual backbone architecture, and then limit the data exchanging region to reduce unnecessary message transmissions. Because the resource node changes very fast, the coordinator must be set to maintain the local node of geographic information in the network. In this scheme, coordinators are established to store information and manage local resource information. In order to ensure dissemination performance, it must guarantee that vehicles possess enough resource pieces to allow efficient bartering. Furthermore, three kinds of piece selection mechanisms, including Nearest-First, Rarest-First, and In-Order are proposed to download resource pieces from other vehicles and to improve the dissemination efficiency. Experiment results demonstrate that our searching and sharing schemes are efficient and outperforms other schemes in terms of satisfactory ratio and download time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Brain Imaging for Diagnosis of Schizophrenia: Challenges, Successes and a Research Road Map User-centric Trust-based Recommendation Do Videowikis on the Web Support Better (Constructivist) Learning in the Basics of Information Systems Science? An MDA-Based Approach for WS Composition Using UML Scenarios A Mobile Data Analysis Framework for Environmental Health Decision Support
×
引用
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