Skip to content
Open access

A hybrid crow search and Harris Hawks optimization approach for clustering based routing in vehicular ad hoc networks

Aug 2026 · Discover Internet of Things · Vol 6 · 0 citations · 56 references

TL;DR

Simulation results demonstrate that the proposed CRAHO framework significantly outperforms benchmark routing protocols in maintaining network stability and optimizing data transmission in highly mobile vehicular environments.

Abstract

Vehicular Ad Hoc Networks (VANETs) are characterized by highly dynamic topologies, leading to frequent link breakages and challenging reliable routing. While clustering effectively mitigates topology instability, optimal Cluster Head (CH) selection and routing remain NP-hard problems. Despite various existing approaches, many current meta-heuristic routing protocols struggle to balance exploration and exploitation in highly dynamic VANET environments, often suffering from premature convergence and cluster instability under high mobility. To address these critical limitations, this paper proposes CRAHO, a novel hybrid meta-heuristic approach integrating the CSA and HHO for robust clustering-based routing in VANETs. Specifically, CSA is employed during the clustering phase to evaluate critical parameters—such as communication link quality and spatial distance—to form highly stable clusters. Subsequently, the routing phase leverages HHO based on distance metrics and node degrees to establish optimal, persistent inter-cluster paths. By formulating a comprehensive multi-objective fitness function, the CRAHO algorithm effectively coordinates exploration and exploitation. This approach guarantees QoS by minimizing routing overhead and end-to-end delay while maximizing the Packet Delivery Ratio (PDR). Simulation results demonstrate that the proposed CRAHO framework significantly outperforms benchmark routing protocols in maintaining network stability and optimizing data transmission in highly mobile vehicular environments. Specifically, compared to the baseline methods, CRAHO achieves improvements of 10.06% in network lifetime, 10.65% in throughput, 6.72% in PDR, and a 6.41% reduction in end-to-end delay.

Read PDF

Similar papers

Open access Jul 2026

A Novel RL-Driven Zone-Based Leader-Aware Energy-Efficient Routing Protocol for Dynamic MANET Environments

The paper introduces RML-ZEREM to solve existing limitations, which functions as a Reinforcement Learning (RL) based Zone-Based Leader-Aware Energy-Efficient Routing Protocol for MANETs, which serves next-generation MANET applications.

Rani Sahu, Babita Rathore · 0 citations
Open access Aug 2026

A Q-learning Weighted Cluster Based Routing Protocol for VANETs

Simulation results obtained demonstrate that Q-WeCBR outperforms CBR, DSDV, and GPSR in terms of packet delivery ratio and throughput, confirming the effectiveness of clustering combined with learning-based routing for dynamic vehicular networks.

Ahlam Boussadia · 0 citations
Open access Jul 2026

An Optimization of Multiple Route Selection in Flying Ad Hoc Network

Simulation results indicate that HOA-MEPFL-CLCT-RP outperforms existing models in terms of Packet Delivery Ratio (PDR), energy efficiency, End-to-End Delay (E2D), and routing overhead.

Shaleena H, Sumangala K · 0 citations
Jul 2026

A Center-of-Gravity and Fuzzy C-Means-Based Clustering Routing Algorithm for Wireless Sensor Networks

In wireless sensor networks with resource-constrained and randomly deployed nodes, extending network lifetime remains a critical challenge. Energy efficiency, as a key determinant of network longevity, has become a central focus in routing protocol design, positioning clustering mechanisms as a widely adopted solution. This paper investigates cluster head election, cluster formation, and data transmission path construction to develop a clustering routing strategy that balances energy consumption and improves efficiency. To overcome limitations in existing cluster head election objective functions that inadequately capture the synergy between node energy and spatial distribution, this paper proposes CGFCM, an adaptive clustering routing protocol integrating a center-of-gravity model with the fuzzy C-means algorithm. The protocol defines a cluster head election objective function jointly considering node energy status and spatial location. A center-of-gravity formulation characterizes node mass based on energy and location, while nodes are classified into internal, boundary, and transitional categories according to cohesion and synergy factors, enhancing topology awareness. In cluster formation, fuzzy C-means clusters internal nodes, and non-internal nodes join via a fitness function. Candidate cluster heads are selected from internal nodes using an energy threshold, from which the optimal cluster head is chosen through an objective function incorporating centroid distance, node mass, residual energy, and node density. Additionally, rotation intervals and relay paths are dynamically adjusted to reduce reconfiguration overhead and alleviate cluster head load. Simulation results show that CGFCM achieves superior performance in balancing network energy consumption and extending network lifetime. In the scenario where the base station is located at (100, 100), the FND of CGFCM is improved by 40.50%, 51.42%, and 17.65% compared with EHCR-FCM, PSO, and EDFIKM algorithms, respectively, which demonstrates its performance advantages under typical deployment conditions.

Xiangmin Ding, Cuifang Gao · 0 citations
Open access Aug 2026

Analytical Evaluation of VANETs Routing Strategies

The proposed SPN model enables system architects to compare routing configurations, identify performance bottlenecks, and size infrastructure components without requiring physical deployment, and enables the identification of communication bottlenecks without requiring physical deployment.

José Miquéias Araújo, L. Lopes, Luiz Nelson Lima et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.