Deadline-aware packet routing based on optimal charging schedule in electric vehicular networks

摘要

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.