Abstract
We present a deadline-aware packet routing based on optimal charging schedule in Electric Vehicular Ad Hoc Networks. It aims to propose an optimal charging schedule by incorporating EVs as packet carrier and its regular trajectory. Also, we aim to find out an energy efficient routing path by utilizing the EVs for delivering data packets from stationary nodes scattered over the network. We formulate the charging schedule problem into a binary integer program considering a packet deadline constraint. Along with this, we propose a routing protocol to forward data packets over a cost-effective route with the lowest packet transmission cost by fully exploiting EVs. We validate our optimal charging schedule in terms of acceptance ratio and service waiting time compared to a baseline counterpart. We also evaluate our routing protocol in terms of routing cost and on-time packet delivery ratio. We demonstrate that our algorithm increases the acceptance ratio of EVs in an overloaded situation, while decreasing the overall routing cost for forwarding data over the EV network.
Original language | English |
---|---|
Title of host publication | 30th International Conference on Information Networking, ICOIN 2016 |
Publisher | IEEE Computer Society |
Pages | 172-177 |
Number of pages | 6 |
ISBN (Electronic) | 9781509017249 |
DOIs | |
State | Published - 7 Mar 2016 |
Event | 30th International Conference on Information Networking, ICOIN 2016 - Kota Kinabalu, Malaysia Duration: 13 Jan 2016 → 15 Jan 2016 |
Publication series
Name | International Conference on Information Networking |
---|---|
Volume | 2016-March |
ISSN (Print) | 1976-7684 |
Conference
Conference | 30th International Conference on Information Networking, ICOIN 2016 |
---|---|
Country/Territory | Malaysia |
City | Kota Kinabalu |
Period | 13/01/16 → 15/01/16 |
Bibliographical note
Funding Information:This work was supported by Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Education(NRF-2015R1D1A1A01057902), and by the Ministry of Science, ICT, and Future Planning(NRF-2013R1A2A2A04014772)
Publisher Copyright:
© 2016 IEEE.