Biometric plays a vital role in human authentication systems. Unimodal and multimodal biometrics have been active research areas for the past few decades. The investigation of palmprint recognition under various illuminations, rotations, and translations is a challenging task. The research work on multimodal palmprint recognition systems has widely increased to improve the recognition rate and reduce execution time. In this article, a multimodal palmprint biometric system is formed by combining the left and right palmprint images to obtain an optimal recognition rate. A modified multilobe ordinal filter (MMLOF) is used to extract the features. Feature-level fusion is used to fuse the left and right palmprint images. This results in a high-dimension feature vector that requires larger memory to store. It creates redundant and irrelevant features that affect the recognition rate. To overcome these limitations, the optimal MMOF features are extracted by optimization techniques such as particle swarm optimization (PSO) and the genetic algorithm (GA). Finally, PSO and GA optimization algorithms are wrapped with the nearest neighbor classifier (NN) to evaluate the fitness function. The experimental analyses are conducted to identify the performance of GA and PSO using the IITD palmprint dataset. The 1st order MMLOF with GA (multimodal) converges faster and outperforms the 1st order MMLOF with PSO (multimodal) and obtains an optimal recognition rate of 96.95%.

No abstract

No abstract

No abstract

Vehicle ad-hoc networks (VANETs) have become a prominent research topic in recent years due to rapid dynamic topology, high vehicle mobility, frequent link failures and significant delay constraints. The mobility of the vehicle nodes increases, and the overhead of control traffic due to the high dynamics of the VANET. Efficient routing algorithms are necessary for VANETs to ensure reliable transmission (VANETs). This work proposes a Traffic Density Stable Routing Protocol based on Connection- and Distance (TDSRP-DC) to avoid data packet collisions at intersections and an adaptive routing schedule based on the selection at every instant. Our approach is based on vehicle-to-vehicle communication. Ground vehicles identify the most appropriate next junction and transfer the data packet to the receiver to find the optimal multi-hop route. It relies on transferring the data between all vehicles to estimate real-time traffic fluctuations sporadically. Network formation, neighbor realization, fitness value prediction, and routing methodology are the conceptual process needed in this research. Valid parameters for finding the optimum path in the conceptual model include node distance, node speed, node azimuth, link stability, and link reliability. The suggested solution's simulation was performed in comparison to traditional algorithms. Compared to existing TFOR algorithms on complex traffic, the proposed TDSRP-DC provides tremendous improvements based on packet delivery rate (10%) and performance (35%). The demonstrated results and comparisons illustrate the proposed routing protocol's significance with enhanced quality of service performance.