TY - GEN
T1 - Deadline-aware packet routing based on optimal charging schedule in electric vehicular networks
AU - Sharmin, Nusrat
AU - Lee, Hyungjune
N1 - 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.
PY - 2016/3/7
Y1 - 2016/3/7
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84963946937&partnerID=8YFLogxK
U2 - 10.1109/ICOIN.2016.7427109
DO - 10.1109/ICOIN.2016.7427109
M3 - Conference contribution
AN - SCOPUS:84963946937
T3 - International Conference on Information Networking
SP - 172
EP - 177
BT - 30th International Conference on Information Networking, ICOIN 2016
PB - IEEE Computer Society
T2 - 30th International Conference on Information Networking, ICOIN 2016
Y2 - 13 January 2016 through 15 January 2016
ER -