Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

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

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 13 No. 3 (2023)

DOI
10.11591/ijece.v13i3.pp3140-3148
ISSN
2722-2578, 2088-8708
Published
2023-06-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

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%.

Collaboration network of the authors

14 authors · 35 co-authorship links · 20 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Université Hassan 1er
  • Université Moulay Ismail de Meknes
  • Sidi Mohamed Ben Abdellah University
  • École Supérieure d'Électronique de l'Ouest
  • Royal Military College of Canada
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Mohamed LatrachÉcole Supérieure d'Électronique de l'Ouest3
Elhassane AbdelmounimUniversité Hassan 1er2
Jamal ZbitouUniversité Hassan 1er2
Abdelghani El OugliSidi Mohamed Ben Abdellah University2
Walid En-NaghmaSidi Mohamed Ben Abdellah University2
Mohamed IhamjiUniversité Hassan 1er1
Mostafa HefnawiRoyal Military College of Canada1
Ahmed El HamraouiUniversité Hassan 1er1
EL Hassane AbdelmounimAffiliation unknown1
Khalifa EchchakhaouiUniversité Hassan 1er1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>A novel k-means powered algorithm for an efficient clustering in vehicular ad-hoc networks</dc:title><dc:creator>Kandali, Khalid</dc:creator><dc:creator>Bennis, Lamyae</dc:creator><dc:creator>Halaq, Hanan</dc:creator><dc:creator>Bennis, Hamid</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;p&amp;gt;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%.&amp;lt;/p&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2023-06-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v13i3.pp3140-3148</dc:identifier><dc:identifier>10.11591/ijece.v13i3.pp3140-3148</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 13 No 3 (2023); 3140</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>https://ijece.iaescore.com/index.php/IJECE/article/viewFile/29258/16560</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>