Treffer: An Intelligent Optimized Route-Discovery Model for IoT-Based VANETs.
Weitere Informationen
Intelligent Transportation system are becoming an interesting research area, after Internet of Things (IoT)-based sensors have been effectively incorporated in vehicular ad hoc networks (VANETs). The optimal route discovery in a VANET plays a vital role in establishing reliable communication in uplink and downlink direction. Thus, efficient optimal path discovery without a loop-free route makes network communication more efficient. Therefore, this challenge is addressed by nature-inspired optimization algorithms because of their simplicity and flexibility for solving different kinds of optimization problems. NIOAs are copied from natural phenomena and fall under the category of metaheuristic search algorithms. Optimization problems in route discovery are intriguing because the primary objective is to find an optimal arrangement, ordering, or selection process. Therefore, many researchers have proposed different kinds of optimization algorithm to maintain the balance between intensification and diversification. To tackle this problem, we proposed a novel Java macaque algorithm based on the genetic and social behavior of Java macaque monkeys. The behavior model mimicked from the Java macaque monkey maintains well-balanced exploration and exploitation in the search process. The experimentation outcome depicts the efficiency of the proposed Java macaque algorithm compared to existing algorithms such as discrete cuckoo search optimization (DCSO) algorithm, grey wolf optimizer (GWO), particle swarm optimization (PSO), and genetic algorithm (GA). [ABSTRACT FROM AUTHOR]
Copyright of Processes is the property of MDPI and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)