Vehicular ad-hoc network (VANET) is highly dynamic due to the high speed and sparse distribution of vehicles on the road. This creates major challenges (e.g., network fragmentation, packet routing) for the researchers to enable robust, reliable, and scalable communication, especially in a highly dense network. Clustering in VANET is one of the remedies to address the scalability issue. However, it is observed in the literature, that existing clustering techniques produce a high number of clusters for the vehicular environment. Consequently, it increases the consumption of scarce resources in a wireless network. Furthermore, it also increases the communication overhead as well as the number of hops for data routing. As a result communication latency also increases and the reliability of communication protocol decreases. So it is highly desirable to find out the optimal clusters for a given vehicular environment. As finding optimal clusters is a multi-objective combinatorial optimization problem, therefore by employing nature-inspired meta-heuristic algorithms we can optimize the multi-objective problem. To this end, we proposed a novel clustering algorithm based on the Harris Hawks Optimization (HHO) algorithm for VANET (HHOCNET). HHO algorithm is a nature-inspired meta-heuristic algorithm inspired by the foraging maneuver of hawks called surprise pounce. The proposed framework imitates the cooperative foraging maneuver of hawks (i.e., surprise pounce for creating optimized vehicular clusters). The stochastic operators of the HHO algorithm and proper maintenance of the equilibrium state between the operations of exploration and exploitation enable the proposed algorithm to escape from the local optima and provide a globally optimal solution (i.e., the optimal number of vehicular clusters). Simulations are performed in MATLAB and the results are compared with the state-of-art schemes (i.e., Gray Wolf optimization-based clustering algorithm (GWOCNET), Multi-objective Particle Swarm Optimization (MO, PSO), and Comprehensive Learning Particle Swarm Optimization (CLPSO)) using different performance metrics. The results demonstrate that the proposed approach is an effective approach for clustering in VANET and outer performs the other benchmark algorithms in terms of optimizing the multi-objective clustering problem. HHOCNET algorithm selects 36.04% of nodes as cluster heads while the existing state-of-the-art schemes are providing 50.42%, 56.7%, and 60.89% for GWOCNET, CLPSO, and Multi-objective Particle Swarm Optimization (MOPSO). The proposed HHOCNET algorithm enhances the performance of the vehicular network by up to 15%. Consequently, it increases network efficiency by reducing the consumption of the required wireless resources. It also reduces the number of hops for packet routing. Hence it achieves a minimum end-to-end communication latency.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Harris Hawks Optimization-Based Clustering Algorithm for Vehicular Ad-Hoc Networks


    Beteiligte:
    Ali, Asad (Autor:in) / Aadil, Farhan (Autor:in) / Khan, Muhammad Fahad (Autor:in) / Maqsood, Muazzam (Autor:in) / Lim, Sangsoon (Autor:in)


    Erscheinungsdatum :

    2023-06-01


    Format / Umfang :

    3410933 byte




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    UAV Path Planning Based on Rolling Sine-Cosine Harris Hawks Optimization

    Yang, Huan / Fang, Yangwang | Springer Verlag | 2023


    Aerodynamic Parameter Identification of Hypersonic Vehicles Based on Improved Harris Hawks Optimization

    Chu, Yin / Chun-wang, Qiao / Rui, Cao et al. | Springer Verlag | 2023


    Design of PID Controller for Magnetic Levitation System using Harris Hawks Optimization

    Kadry, Seifedine / Rajinikanth, Venkatesan | BASE | 2021

    Freier Zugriff


    Traffic Signal Timing Scheme Based on the Improved Harris Hawks Optimisation

    Hongluan Zhao / Mengmeng Su | DOAJ | 2024

    Freier Zugriff