Chaotic Particle Swarm Optimization Based Shortest Path Routing in VANET

The present study examines the Vehicle Ad hoc Networks (VANETs) exhibit unexpected behavior due to their high mobility and random network structure. Including ad hoc networks, a variety of problems, including repeated connected breakdowns, flexibility, multi-hop transmission of information, and information loss, impact Transmission Control Protocols (TCP). To overcome this problem, this paper suggests employing zone-based routing in VANETs while taking mobility into account. The routing technique is implemented with a hybrid optimization strategy. The most significant swarm intelligence (SI) algorithm for solving optimization issues is the chaotic particle swarm optimization (CPSO) algorithm. Due to its simplicity, which involves just a few parameters, CPSO has grown to be considered one of the most frequently used optimization techniques. When resolving challenging optimization problems, the routing algorithms experience high overhead or incompatibilities. A CPSO based shortest path routing method is presented for VANET that offers a high-quality path for connection among nodes, improving the distribution of packets percentage and preventing end-to-end delay, in order to enhanced routing effectiveness and throughput in prevailing approaches. These achievements show that CPSO performs adequately and is experiencing significant progress.