Metaheuristics-based Clustering with Routing Technique for Lifetime Maximization in Vehicular Networks

4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Recently, vehicular ad hoc networks (VANETs) finds applicability in different domains such as security, rescue operations, intelligent transportation systems (ITS), etc. VANET has unique features like high mobility, limited mobility patterns, adequate topology modifications, and wireless communication. Despite the benefits of VANET, scalability is a challenging issue which could be addressed by the use of cluster-based routing techniques. It enables the vehicles to perform intercluster communication via chosen CHs and optimal routes. The main drawback of VANET network is the network unsteadiness that results in minimum lifetime. In order to avoid reduced network lifetime in VANET, this paper presents an enhanced metaheuristics based clustering with multihop routing technique for lifetime maximization (EMCMHR-LM) in VANET. The presented EMCMHR-LM model involves the procedure of arranging clusters, cluster head (CH) selection, and route selection appropriate for VANETs. The presented EMCMHR-LM model uses slime mold optimization based clustering (SMO-C) technique to group the vehicles into clusters. Besides, an enhanced wild horse optimization based multihop routing (EWHO-MHR) protocol by the optimization of network parameters. The presented EMCMHR-LM model is simulated using Network Simulator (NS3) tool and the simulation outcomes reported the enhanced performance of the proposed EMCMHR-LM technique over the other models.

Cite

CITATION STYLE

APA

Muthukrishnan, P., & Muthu Kannan, P. (2023). Metaheuristics-based Clustering with Routing Technique for Lifetime Maximization in Vehicular Networks. Computers, Materials and Continua, 74(1), 1107–1122. https://doi.org/10.32604/cmc.2023.031962

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free