VShare:一种基于分层云架构的无线社交网络辅助车辆共享系统

Yuhua Lin, Haiying Shen
{"title":"VShare:一种基于分层云架构的无线社交网络辅助车辆共享系统","authors":"Yuhua Lin, Haiying Shen","doi":"10.1109/IoTDI.2015.30","DOIUrl":null,"url":null,"abstract":"Carpool commuting enables multiple individual travelers with similar schedules and itineraries to share a common vehicle during a trip, and travelers can split travel costs in gas, parking and tolls with each other. It emerges as an effective way to solve traffic congestion, parking space tension and air pollution resulting from vehicle emissions. One of the challenges that restrict widespread adoption of carpool commuting lies in matching carpoolers. Existing carpooler matching methods include building carpool lanes in main airports and bus stops, using centralized servers to identify carpoolers based on historical travel data or real time travel requests. However, these methods cannot be applied to large scale adoption or incur long matching latency. To overcome drawbacks of existing methods, we propose VShare, a dynamic carpool system that leverages the wireless social network characteristic and hierarchical cloud server architecture. VShare incorporates two design components: matching through the wireless social network and a hierarchical cloud server structure. Upon receiving a user travel request, VShare first identifies possible carpoolers from neighbors in nearby locations, which reduces latency of sending travel requests to remote servers. If no carpool is found within nearby locations, a hierarchical cloud server architecture is used to match the travel requests. We have implemented the design of VShare and conducted trace-driven experiments. Experimental results show the effectiveness of VShare in substantially reducing matching latency while providing high success rate in matching carpollers.","PeriodicalId":135674,"journal":{"name":"2016 IEEE First International Conference on Internet-of-Things Design and Implementation (IoTDI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"VShare: A Wireless Social Network Aided Vehicle Sharing System Using Hierarchical Cloud Architecture\",\"authors\":\"Yuhua Lin, Haiying Shen\",\"doi\":\"10.1109/IoTDI.2015.30\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Carpool commuting enables multiple individual travelers with similar schedules and itineraries to share a common vehicle during a trip, and travelers can split travel costs in gas, parking and tolls with each other. It emerges as an effective way to solve traffic congestion, parking space tension and air pollution resulting from vehicle emissions. One of the challenges that restrict widespread adoption of carpool commuting lies in matching carpoolers. Existing carpooler matching methods include building carpool lanes in main airports and bus stops, using centralized servers to identify carpoolers based on historical travel data or real time travel requests. However, these methods cannot be applied to large scale adoption or incur long matching latency. To overcome drawbacks of existing methods, we propose VShare, a dynamic carpool system that leverages the wireless social network characteristic and hierarchical cloud server architecture. VShare incorporates two design components: matching through the wireless social network and a hierarchical cloud server structure. Upon receiving a user travel request, VShare first identifies possible carpoolers from neighbors in nearby locations, which reduces latency of sending travel requests to remote servers. If no carpool is found within nearby locations, a hierarchical cloud server architecture is used to match the travel requests. We have implemented the design of VShare and conducted trace-driven experiments. Experimental results show the effectiveness of VShare in substantially reducing matching latency while providing high success rate in matching carpollers.\",\"PeriodicalId\":135674,\"journal\":{\"name\":\"2016 IEEE First International Conference on Internet-of-Things Design and Implementation (IoTDI)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE First International Conference on Internet-of-Things Design and Implementation (IoTDI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IoTDI.2015.30\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE First International Conference on Internet-of-Things Design and Implementation (IoTDI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IoTDI.2015.30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

摘要

拼车通勤使得多个日程和行程相似的个人旅行者可以在旅途中共用一辆车,旅行者可以分摊汽油、停车和通行费。它是解决交通拥堵、停车位紧张和车辆排放造成的空气污染的有效途径。限制拼车通勤广泛采用的挑战之一是如何匹配拼车者。现有的拼车匹配方法包括在主要机场和公交车站建立拼车车道,使用集中式服务器根据历史出行数据或实时出行请求识别拼车者。但是,这些方法不能应用于大规模采用,否则会导致较长的匹配延迟。为了克服现有方法的缺点,我们提出了VShare,一种利用无线社交网络特性和分层云服务器架构的动态拼车系统。VShare包含两个设计组件:通过无线社交网络进行匹配和分层云服务器结构。在收到用户的出行请求后,VShare首先从附近的邻居中识别可能的拼车者,从而减少了向远程服务器发送出行请求的延迟。如果在附近的地点没有找到拼车,则使用分层云服务器架构来匹配旅行请求。我们实现了VShare的设计,并进行了跟踪驱动实验。实验结果表明,VShare在提供高匹配成功率的同时,显著降低了匹配延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
VShare: A Wireless Social Network Aided Vehicle Sharing System Using Hierarchical Cloud Architecture
Carpool commuting enables multiple individual travelers with similar schedules and itineraries to share a common vehicle during a trip, and travelers can split travel costs in gas, parking and tolls with each other. It emerges as an effective way to solve traffic congestion, parking space tension and air pollution resulting from vehicle emissions. One of the challenges that restrict widespread adoption of carpool commuting lies in matching carpoolers. Existing carpooler matching methods include building carpool lanes in main airports and bus stops, using centralized servers to identify carpoolers based on historical travel data or real time travel requests. However, these methods cannot be applied to large scale adoption or incur long matching latency. To overcome drawbacks of existing methods, we propose VShare, a dynamic carpool system that leverages the wireless social network characteristic and hierarchical cloud server architecture. VShare incorporates two design components: matching through the wireless social network and a hierarchical cloud server structure. Upon receiving a user travel request, VShare first identifies possible carpoolers from neighbors in nearby locations, which reduces latency of sending travel requests to remote servers. If no carpool is found within nearby locations, a hierarchical cloud server architecture is used to match the travel requests. We have implemented the design of VShare and conducted trace-driven experiments. Experimental results show the effectiveness of VShare in substantially reducing matching latency while providing high success rate in matching carpollers.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信