Full metadata record
DC FieldValueLanguage
dc.contributor.authorYang, Shun-Nengen_US
dc.contributor.authorCheng, Wei-Shengen_US
dc.contributor.authorHsu, Yu-Chingen_US
dc.contributor.authorGan, Chai-Hienen_US
dc.contributor.authorLin, Yi-Bingen_US
dc.date.accessioned2017-04-21T06:50:07Z-
dc.date.available2017-04-21T06:50:07Z-
dc.date.issued2011en_US
dc.identifier.isbn978-0-7695-4576-9en_US
dc.identifier.issn1521-9097en_US
dc.identifier.urihttp://dx.doi.org/10.1109/ICPADS.2011.42en_US
dc.identifier.urihttp://hdl.handle.net/11536/134808-
dc.description.abstractToday, charging stations (CSs) for electric vehicles (EVs) are much less popular than gas stations. Therefore, searching and selecting CSs is an important issue for the drivers of EVs. This paper investigates the EV charging problem. We propose two types of CS-selection algorithms. The first type only utilizes local information of an EV. The second type utilizes the global information obtained from mobile computing. Specifically, the EVs interact with a Global CS-selection (GCS) server through the mobile telecommunications network. Our study indicates that by using the global information (specifically the workload status of each CS), the EVs can be effectively charged with short waiting times at the CSs.en_US
dc.language.isoen_USen_US
dc.subjectwireless communicationen_US
dc.subjectmobile computingen_US
dc.subjectcharge schedulingen_US
dc.subjectcharging station selectionen_US
dc.subjectelectric vehicleen_US
dc.titleCharge Scheduling of Electric Vehicles in Highways through Mobile Computingen_US
dc.typeProceedings Paperen_US
dc.identifier.doi10.1109/ICPADS.2011.42en_US
dc.identifier.journal2011 IEEE 17TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS)en_US
dc.citation.spage692en_US
dc.citation.epage698en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000299395900090en_US
dc.citation.woscount0en_US
Appears in Collections:Conferences Paper