Literature Database Entry

reddy2019performance


G. Rajeswar Reddy and R. Ramanathan, "Performance analysis of clustering for message classification and congestion control in DSRC/WAVE-based vehicular ad-hoc networks," Inderscience International Journal of Vehicle Information and Communication Systems, vol. 4 (1), pp. 55–77, January 2019.


Abstract

Vehicular Ad-Hoc Networks (VANETs) play a significant role in Intelligent Transportation Systems (ITS). The vehicles exchange awareness and safety information with surrounding vehicles using IEEE 802.11p Dedicated Short Range Communications (DSRC) and IEEE 1609 Wireless Access in Vehicular Environment (WAVE)-based short-range communication networks in 5.9 GHz band. These safety messages include periodic beacon messages and event driven emergency messages that are shared in Control Channel (CCH). By collecting these messages and applying clustering we can facilitate new applications like network congestion control, traffic control etc. The partitioning-based clustering methods like the k-means, the Partitioning Around Medoids (PAM) are well known in data science. This paper focuses on understanding the message clustering intuitively. The clustering quality is measured using silhouette plot and average silhouette width. The simulation is carried out in OMNeT++ and SUMO-based Veins framework. A simple approach using a package called RInside is explored for fast prototyping of machine learning algorithms in OMNeT++ simulations.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

G. Rajeswar Reddy
R. Ramanathan

BibTeX reference

@article{reddy2019performance,
    author = {Reddy, G. Rajeswar and Ramanathan, R.},
    doi = {10.1504/IJVICS.2019.099067},
    title = {{Performance analysis of clustering for message classification and congestion control in DSRC/WAVE-based vehicular ad-hoc networks}},
    pages = {55--77},
    journal = {Inderscience International Journal of Vehicle Information and Communication Systems},
    issn = {1471-0242},
    publisher = {Inderscience},
    month = {1},
    number = {1},
    volume = {4},
    year = {2019},
   }
   
   

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 proceedings 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.