Title: An efficient cloud-assisted best-parking algorithm for BikeNet

Authors: Hong-Yi Chang; Shih-Chang Huang; Yuan-Wei Lin

Addresses: Department of Management Information Systems, National Chiayi University, Chiayi 60054, Taiwan ' Department of Computer Science and Information Engineering, National Formosa University, Yunlin 63201, Taiwan ' Department of Mobile Internet, Industrial Technology Research Institute, Hsinchu 31040, Taiwan

Abstract: 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.

Keywords: BikeNet; bike networks; cloud computing; MapReduce; best parking; cycling; bicycles; parking spaces; simulation; bike parking; bike stations.

DOI: 10.1504/IJAHUC.2014.064349

International Journal of Ad Hoc and Ubiquitous Computing, 2014 Vol.16 No.2, pp.136 - 148

Received: 30 Jan 2013
Accepted: 22 Aug 2013

Published online: 19 Aug 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article