Optimal route selection for vehicular ad hoc networks using lion algorithm

Abstract EN

Vehicular Ad-hoc NETworks (VANETs) are very important in the field of Intelligent Transportation system (ITS) for enhancing the safety of road.

The communication between the vehicles will be covered under the VANETS.

A lot of research works are there in the area of VANET development.

The common problem that arises is achieving multi constrained Quality of Service metrics.

In order to solve this problem, this paper proposes an optimal routing discovery algorithm to aid the routing process in the VANET.

Firstly, this paper derives a cost model for vehicle routing problems by considering the network quality metrics such as travel cost, collision, congestion, and the awareness about the quality of service (QoS).

The QoS awareness is fuzzified into cost model to be included in the total routing cost.

Since the routing cost model is a minimization function, a recently introduced bio-inspired optimization algorithm, called lion algorithm (LA), is used to solve the function.

The performance is investigated using three renowned analyses such as convergence analysis, cost analysis, and complexity analysis.

The simulated results obtained using MATLAB are compared with the existing Genetic algorithm (GA) based solution.

It is found that the Lion algorithm performs better than the GA with a decrease in routing cost and complexity.