Literature Database Entry

arkian2014cluster


Hamid Reza Arkian, Reza Ebrahimi Atani, Atefe Pourkhalili and Saman Kamali, "Cluster-based traffic information generalization in Vehicular Ad-hoc Networks," Elsevier Vehicular Communications, vol. 1 (4), pp. 197-207, October 2014.

Abstract

vehicles, Abstract Vehicular Ad-hoc Network (VANET) is an emerging field of wireless networks providing different applications such as traffic information for participant and related authorities. However, deploying of such applications is mainly depending on the market penetration rate of this technology. In this paper, we propose a new 3-steps approach for estimation of traffic volume in a road segment based on actual volume of wireless-equipped vehicles. For this propose, we first collect the traffic information for different groups of vehicles using a new clustering algorithm. Then, a chaining technique between the clusters transmits this information to a roadside cloud. Finally, we employ a generalization method to extension of the total traffic volume from the collected data. Performance of the proposed approach is evaluated using extensive simulation for different traffic densities, and technique, the stability of the clustering and schemes., also estimation accuracy of the proposed approach is shown in comparison with state-of-the-art existing

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

Hamid Reza Arkian
Reza Ebrahimi Atani
Atefe Pourkhalili
Saman Kamali

BibTeX reference

@article{arkian2014cluster,
    author = {Arkian, Hamid Reza and Atani, Reza Ebrahimi and Pourkhalili, Atefe and Kamali, Saman},
    title = {{Cluster-based traffic information generalization in Vehicular Ad-hoc Networks}},
    journal = {Elsevier Vehicular Communications},
    pages = {197-207},
    volume = {1},
    number = {4},
    keywords = {Clustering},
    year = {2014},
    month = {October},
    publisher = {Elsevier},
    issn = {2214-2096},
    doi = {10.1016/j.vehcom.2014.08.003},
   }
   
   

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.