Solving station decision problem in bicycle ad hoc networks
by Wen Ouyang; Chang Wu Yu; Kun-Ming Yu; Ko-Jui Lin; Hsin-Wen Chang; Hung-Nien Hsieh; Lin-Li Tai; Chung-Han Lin
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 16, No. 2, 2014

Abstract: The sport of biking has gained in popularity recently, leading to public bicycle systems (PBSs) being adopted in many cities and communities around the world. However, developing and designing a successful PBS is challenging. This work proposes a novel problem called station decision problem for bicycle ad hoc networks. The problem is to find the minimum number of bike stations required while satisfying reachability and richness conditions. After that, practical geographic concerns, such as unreachable areas and maximum distances, are considered. Station decision algorithms are provided, with simulations conducted to demonstrate the effectiveness of the methods. Real site data are also plugged in to show the result of the station decision algorithms.

Online publication date: Tue, 19-Aug-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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:

Username:        Password:          Forgotten your 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