Literature Database Entry

radhakrishnan2017efficient


I. Radhakrishnan, R. Souay, M. R. Palattellaz and T. Engel, "An efficient service channel allocation scheme in SDN-enabled VANETs," Proceedings of 16th Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net 2017), Budva, Montenegro, June 2017.

Abstract

Providing infotainment services in Vehicular Adhoc Networks (VANETs) is a key functionality for the future intelligent transportation systems. However, the unique features of vehicular networks such as high velocity, intermittent communication links and dynamic density can induce severe performances degradation for infotainment services running on the six Service Channels (SCHs) available in the Dedicated Short Range Communication (DSRC). Although, the Wireless Access in the Vehicular Environment (WAVE) has been proposed for VANETs to support these applications and guarantee the QoS by proposing four different access categories, no service channel scheme has been proposed to ensure fair and interference-aware allocation. To fill this gap, in this work we propose ESCiVA, an Efficient Service Channel allocation Scheme in SDN-enabled VAnets to balance service traffic on the six SCHs and mitigate interferences between services provided on adjacent channels. Extensive simulation results confirm that ESCiVA outperforms the basic SCH allocation method, defined in the WAVE standard.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

I. Radhakrishnan
R. Souay
M. R. Palattellaz
T. Engel

BibTeX reference

@inproceedings{radhakrishnan2017efficient,
    author = {Radhakrishnan, I. and Souay, R. and Palattellaz, M. R. and Engel, T.},
    title = {{An efficient service channel allocation scheme in SDN-enabled VANETs}},
    booktitle = {16th Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net 2017)},
    year = {2017},
    month = {June},
    address = {Budva, Montenegro},
    publisher = {IEEE},
    doi = {10.1109/MedHocNet.2017.8001644},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceeedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.