Title: Density Based Clustering algorithm for Vehicular Ad-Hoc Networks

Authors: Slawomir Kuklinski, Grzegorz Wolny

Addresses: Faculty of Electronics and Information Technology, Institute of Telecommunications, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warsaw, Poland; Telekomunikacja Polska, Research and Development Centre Branch, Obrzezna 7, 02-691 Warsaw, Poland. ' Faculty of Mathematics, Informatics, and Mechanics, University of Warsaw, Banacha 2, 02-097 Warsaw, Poland; Telekomunikacja Polska, Research and Development Centre Branch, Obrzezna 7, 02-691 Warsaw, Poland

Abstract: In this paper we present a new multilevel clustering algorithm for Vehicular Ad-Hoc Networks (VANET), which we call the Density Based Clustering (DBC). Our solution is focused on the formation of stable, long living clusters. Cluster formation is based on a complex clustering metric which takes into account the density of the connection graph, the link quality and the road traffic conditions. The tests performed in the simulation environment composed of VanetMobiSim and Java in Simulation Time (JiST)/SWANS have shown that DBC performs better than the popular approach (the Lowest Id algorithm) – the clusters stability has been significantly increased.

Keywords: clustering algorithms; clustering protocol; VANET; density based clustering; stability; ad-hoc networks; reliable communication; road traffic; vehicular networks; simulation; vehicle communications.

DOI: 10.1504/IJIPT.2009.028654

International Journal of Internet Protocol Technology, 2009 Vol.4 No.3, pp.149 - 157

Available online: 22 Sep 2009 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article