A novel k-means powered algorithm for an efficient clustering in vehicular ad-hoc networks

Khalid Kandali, Lamyae Bennis, Hanan Halaq, Hamid Bennis


Considerable attention has recently been given to the routing issue in vehicular ad-hoc networks (VANET). Indeed, the repetitive communication failures and high velocity of vehicles reduce the efficacy of routing protocols in VANET. The clustering technique is considered an important solution to overcome these difficulties. In this paper, an efficient clustering approach using an adapted k-means algorithm for VANET has been introduced to enhance network stability in a highway environment. Our approach relies on a clustering scheme that accounts for the network characteristics and the number of connected vehicles. The simulation indicates that the proposed approach is more efficient than similar schemes. The results obtained appear an overall increase in constancy, proven by an increase in cluster head lifetime by 66%, and an improvement in robustness clear in the overall reduction of the end-to-end delay by 46% as well as an increase in throughput by 74%.


clustering; expected transmission count; K-means algorithm; routing; vehicular ad-hoc networks;

Full Text:


DOI: http://doi.org/10.11591/ijece.v13i3.pp3140-3148

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

International Journal of Electrical and Computer Engineering (IJECE)
p-ISSN 2088-8708, e-ISSN 2722-2578