A Multihoming Clustering Algorithm for Vehicular Ad Hoc Networks

Samo Vodopivec, Janez Bešter and Andrej Kos

International Journal of Distributed Sensor Networks, 2014, vol. 10, issue 3, 107085

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.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2014/107085 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:10:y:2014:i:3:p:107085

DOI: 10.1155/2014/107085

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().