Enhancing Vehicular Ad Hoc Networks’ Dynamic Behavior by Integrating Game Theory and Machine Learning Techniques for Reliable and Stable Routing
VANETs (vehicular ad hoc networks) have evolved as a platform for enabling intelligent inter-vehicle communication while also improving traffic safety and performance. VANETs are a difficult research topic because of the road dynamics, high mobility of cars, their unlimited power supply, and the growth of roadside wireless infrastructures. In wireless networks, game theory approaches have been widely used to investigate the interactions between competitive and cooperative behavior. In this research, we propose a technique for vehicular ad hoc networks that uses a game theory approach to automate vehicle grouping and cluster head nomination. This will eliminate the need for cluster reformation on a regular basis. Furthermore, each vehicle’s social behavior will be exploited to establish clusters in the vehicular environment. For the development of clusters on the social behavior of the cars, a machine learning approach (K-means algorithm) is applied. The proposed system is tested against a variety of characteristics, including CH life time, average cluster member life time, average number of reaffiliation times, throughput, and packet loss rate, and the results indicate that the VANET performed very well with high accuracy in validation and testing, and overall in the range of 0.97 to 0.99.
