...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International journal of ad hoc and ubiquitous computing >An efficient cloud-assisted best-parking algorithm for BikeNet
【24h】

An efficient cloud-assisted best-parking algorithm for BikeNet

机译：一种适用于BikeNet的高效云辅助最佳停车算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Numerous countries have implemented public bike policies. Users can rent a bike in one place, and return it at a different location. However, users that change to another type of transport may spend considerable time searching for a parking space for the bike. This study proposes an efficient best-parking (BP) algorithm for bike networks. This mechanism efficiently offers bike users route with parking spaces nearby destination. This study also presents a parallel BP algorithm based on the MapReduce model to accelerate the computation of the ideal route for parking. Simulation results show that the performance of the proposed algorithm is ～70% better than that of the aggregating data dissemination (ADD) algorithm and 91% better than that of the parking space discovery (PSD) algorithm. The proposed BP algorithm collects parking-space information only as needed. Therefore, the BP communication overhead is considerably lower than that of ADD or PSD algorithms.
机译：许多国家已经实施了公共自行车政策。用户可以在一个地方租一辆自行车，然后将其归还给其他地方。但是，改用其他交通工具的用户可能会花费大量时间来寻找自行车的停车位。这项研究为自行车网络提出了一种有效的最佳停车（BP）算法。该机制有效地为自行车用户提供了目的地附近停车位的路线。这项研究还提出了一种基于MapReduce模型的并行BP算法，以加快理想停车路线的计算。仿真结果表明，该算法的性能比聚合数据分发算法（ADD）提高了约70％，比停车位发现（PSD）算法提高了91％。提出的BP算法仅在需要时才收集停车位信息。因此，BP通信开销明显低于ADD或PSD算法的开销。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号