No abstract

Clustering in vehicular ad hoc networks is an effective approach to make dynamic wireless vehicular sensor networks more manageable and stable. To make vehicle clustering applicable everywhere regardless of the provided infrastructure, vehicles must rely only on themselves and must not take any supporting services, such as location or external communication services, for granted. In this paper, we propose a new clustering metric and a clustering algorithm with multihoming support. It relies only on the vehicle's ability to send and receive wireless packets which identify the vehicle relationship. Clusters are created with redundant connections between nodes to increase the communication reliability in case of topological changes and the cluster creation process is also inverted compared to other algorithms. The presented solution is verified and compared to MOBIC with the use of ns-3 and SUMO simulation tools. Simulation results have confirmed the expected behavior and show that our algorithm achieves better node connectivity and cluster stability than the former.

Communication is the main driving force behind the emerging intelligent transportation systems, which are expected to make traveling safer, more ecological, and faster. The most challenging among all the different communication technologies that will be used are the direct vehicle-to-vehicle communications, because vehicles move with high speeds and in different directions. Apart from that, it is expected that vehicles should be able to organize themselves in an ad hoc network without any assistance from outside entities, such as road side units. To make the ad hoc network less dynamic and communications more reliable, vehicles with similar movement patterns can be grouped together in clusters. Clustering is a well-known method for organizing ad hoc networks and is used in mobile and wireless sensor networks, but with different constraints and goals, so new clustering solutions for vehicular ad hoc networks (VANET) have to be developed. In recent years, this has been a hot topic among researchers and many different clustering algorithms for VANET have been proposed. In this paper, we propose a new clustering metric for VANET, named vehicle interconnection metric, which is based on sending periodic beacons among vehicles and reflects the communication abilities between them. We also propose a new clustering algorithm whose primary goal is increased connectivity and lower number of disconnects. The working principle of this algorithm is also inverted compared to others and uses unneeded cluster head elimination instead of cluster head election. Mathematical analysis of memory usage and communication overhead are provided, predicting low-resource usage. Simulation results, obtained with the ns-3 network simulator and the SUMO vehicle movement simulator, have confirmed the analysis and expected performance in terms of cluster head duration, number of connectivity losses and role switches.