View : 18 Download: 0

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

Title
Deadline-aware packet routing based on optimal charging schedule in electric vehicular networks
Authors
Sharmin N.Lee H.
Ewha Authors
이형준
SCOPUS Author ID
이형준scopus
Issue Date
2016
Journal Title
International Conference on Information Networking
ISSN
1976-7684JCR Link
Citation
vol. 2016-March, pp. 172 - 177
Publisher
IEEE Computer Society
Indexed
SCOPUS scopus
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. © 2016 IEEE.
DOI
10.1109/ICOIN.2016.7427109
ISBN
9781509017249
Appears in Collections:
엘텍공과대학 > 컴퓨터공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE