Station Decision Problem in Bicycle Ad Hoc Networks

Author

Ouyang, Wen ; Yu, Chang Wu ; Yu, Kun-Ming ; Lin, Ko-Jui ; Yu, Jo-Heng ; Chang, Hsin-Wen ; Tai, Lin-Li ; Lin, Chung-Han

Author_Institution

Dept. of Comput. Sci. & Inf. Eng., Chung Hua Univ., Hsinchu, Taiwan

fYear

2012

fDate

4-7 Sept. 2012

Firstpage

876

Lastpage

881

Abstract

Biking has been more and more popular recently where public bicycle systems have been adopted in many cities around the world. However, to develop and design a successful public bicycle system is challenging. This work proposes a novel problem called Station Decision Problem for Bicycle Ad Hoc Networks. The problem is to find minimum number of stations while satisfying reach ability and richness conditions. A station decision (SD) algorithm using graph theory is provided with simulation conducted to prove the effectiveness of this method. A real site data is also plugged in to check the result of the SD algorithm.

Keywords

ad hoc networks; bicycles; reachability analysis; road vehicles; transportation; SD algorithm; bicycle ad hoc networks; graph theory; public bicycle systems; reachability conditions; richness conditions; station decision problem; Ad hoc networks; Bicycles; Cities and towns; Economics; Graph theory; Legged locomotion; Sociology; Bicycle Ad Hoc Networks; Graph Theory; Public Bicycle Systems; Station Decision Problem; reachability; richness;

fLanguage

English

Publisher

ieee

Conference_Titel

Ubiquitous Intelligence & Computing and 9th International Conference on Autonomic & Trusted Computing (UIC/ATC), 2012 9th International Conference on

Conference_Location

Fukuoka

Print_ISBN

978-1-4673-3084-8

Type

conf

DOI

10.1109/UIC-ATC.2012.79

Filename

6332099