Literature Database Entry


Efi Dror, Chen Avin and Zvi Lotker, "Fast randomized algorithm for 2-hops clustering in vehicular ad-hoc networks," Elsevier Ad Hoc Networks, vol. 11 (7), pp. 2002–2015, September 2012.


Vehicular Ad-Hoc Networks (VANETs) enable inter vehicle wireless communication as well as communication with road side equipment. Warning messages can be exchanged among nearby vehicles, helping to predict dangerous situations, and delivery, thus improving road safety. Such safety messages require fast and minimal delay to local areas, in order for them to be effective. Therefore, a fast and efficient channel access scheme is required. A feasible solution, derived from the Mobile Ad-Hoc Networks (MANETs) field, groups nodes into smaller manageable sections called clusters. Such an approach can be beneficial for locally delivering messages under strict time constraints. In this paper, a Hierarchical Clustering Algorithm (HCA) is presented. HCA is a distributed randomized algorithm, which manages channel access by forming three hierarchy clusters. The proposed channel access scheme enables delay bounded reliable communication. Unlike other common clustering algorithm for VANETs, HCA does not require the knowledge of the vehicles’ locations. This feature guarantees accurate operation even when localization systems such as GPS are not available. The running time and analyzed, message complexity were and simulated. Simulation results show that the algorithm behaves well especially under realistic mobility patterns; therefore, it is a suitable solution for channel access scheme for VANETs.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX


Efi Dror
Chen Avin
Zvi Lotker

BibTeX reference

    author = {Dror, Efi and Avin, Chen and Lotker, Zvi},
    doi = {10.1016/j.adhoc.2012.02.006},
    issn = {1570-8705},
    journal = {Elsevier Ad Hoc Networks},
    month = {9},
    number = {7},
    pages = {2002--2015},
    publisher = {Elsevier},
    title = {{Fast randomized algorithm for 2-hops clustering in vehicular ad-hoc networks}},
    volume = {11},
    year = {2012},

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

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

This page was automatically generated using BibDB and bib2web.