Fast Randomized Algorithm for Hierarchical Clustering in Vehicular Ad-Hoc Networks
Vehicular Ad-Hoc NETworks (VANETs) offer communication between vehicles 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, the authors present Hierarchical Clustering Algorithm (HCA), a fast randomized clustering and scheduling algorithm.