An efficient cloud-assisted best-parking algorithm for BikeNet Online publication date: Tue, 19-Aug-2014
by Hong-Yi Chang; Shih-Chang Huang; Yuan-Wei Lin
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 16, No. 2, 2014
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook