Distributed multi-hop clustering algorithm for VANETs based on neighborhood follow

Abstract

Vehicular ad hoc networks (VANETs) have become important components of metropolitan area networks, and clustering for VANETS provides many advantages. However, the stability of current clustering algorithms exhibits poor robustness because a VANET is a highly dynamic scenario. In this study, a novel multi-hop clustering scheme for VANETs, which generates cluster heads (CHs) via neighborhood follow relationship between vehicles, is proposed. The scheme is based on a reasonable assumption that a vehicle cannot certainly identify which vehicle in its multi-hop neighbors is the most suitable to be its CH, but it can easily grasp which vehicle in one-hop distance is the most stable and similar with it, and thus, they most likely belong to the same cluster. Consequently, a vehicle can choose its CH by following the most stable vehicle. The relative mobility between two vehicles combining the gains based on the followed number and the historical following information enables a vehicle to select which target to follow. Extensive simulation experiments are conducted to validate the performance of the proposed clustering scheme.