Performance analysis of Wireless based Vehicular Adhoc Network by Dynamic Self-Configured Weights for high Quality of Service

Abstract

The paper proposes improvised Vehicular Networks (VANETs) in an environment that is constantly subject to changes that give various problems in VANETs, like topology replacement, and also to equalizing small routing paths. The remedy for such a problem is clubbing. The proposed work is about to study five different routing procedures using the “Dynamic Ant flying Cluster (DAFC)” method and Dynamic Self-Configured Weights to meet minimum clubbing, more accuracy, less time, low cost, and Quality of Service (QoS) by choosing efficient cluster-head derived from dynamic clustering.  In this study, by correcting the steps for updating the setting evaporation rate we applied a very large improvement on basic DAFC. In this aspect for better performance evaluation of the proposed routing procedure, two different phases of experiments are conducted. In the initial phase, the classic “Ant Colony Optimization (ACO), DAFC” which is a Clustering method for Vehicular Ad Hoc Networks (VANET) was examined and compared. Subsequently, in the second stage, clustering systems such as “Centre Position and Mobility (CPM)”, “Angle-based Clustering Algorithm (ACA), and Highest-Degree algorithm (HD)” are evaluated using MATLAB and SUMO simulation tools. Through this process, we observed the anticipated behaviour and demonstrated that our proposed method achieves enhanced node connectivity and cluster stability compared to existing approaches. Before delving into the original condition, it is important to note that assessing the efficiency of routing algorithms plays a challenging role in evaluating the performance of routing protocols in VANETs. This study contributes to understanding the statistical “Design of Experiments (DOE)” techniques as an advanced alternative to the “One Factor at a Time (OFAT)” approach for assessing and demonstrating the VANET routing protocol concert. The study employed the 2-level full factorial technique, the Placket–Burman method, and the Taguchi method, comparing and applying them with three design experiment methods. Four key factors were considered in this work: black hole attacks, the number of connections, node density, and wormhole spasms. Their impacts on four measured outputs, namely “throughput, packet loss ratio, average end-to-end delay (EED)”, and routing overhead of the AODV routing protocol, were simultaneously examined and analyzed.