Literature Database Entry


E. Dror, C. Avin and Z. Lotker, "Fast randomized algorithm for hierarchical clustering in Vehicular Ad-Hoc Networks," Proceedings of 10th IFIP/IEEE Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net 2011), Favignana Island, Italy, June 2011, pp. 1–8.


vehicles, Vehicular Ad-Hoc Networks (VANETs) offer communication between and infrastructure. Warning messages, among others, can be used to alert drivers, and thus improve road safety. To adapt to the unique nature of VANETs, which demands the delivery of time sensitive messages to nearby vehicles, fast topology control and scheduling algorithms are required. A clustering approach, which was initially offered for Mobile Ad-Hoc Networks (MANETs), can be adapted to VANETs to solve this problem. In this paper we present Hierarchical Clustering Algorithm (HCA), a fast randomized clustering and scheduling algorithm. HCA creates hierarchical clusters with a diameter of at most four hops. Additionally, the algorithm handles channel access and schedules transmissions within the cluster to ensure reliable communication. Unlike other clustering algorithms for VANETs, HCA does not rely on localization systems which contributes to its robustness. The running time of the algorithm was analyzed analytically and HCA was evaluated by simulation. We compared our algorithm with 2-ConID, a clustering algorithm for MANETs, under several mobility scenarios. The simulation results confirm that the algorithm behaves well under realistic vehicle mobility patterns and stability., outperforms 2-ConID in terms of cluster

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX


E. Dror
C. Avin
Z. Lotker

BibTeX reference

    address = {Favignana Island, Italy},
    author = {Dror, E. and Avin, C. and Lotker, Z.},
    booktitle = {10th IFIP/IEEE Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net 2011)},
    doi = {10.1109/Med-Hoc-Net.2011.5970488},
    month = {6},
    pages = {1--8},
    publisher = {IEEE},
    title = {{Fast randomized algorithm for hierarchical clustering in Vehicular Ad-Hoc Networks}},
    year = {2011},

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.