Skin cancer is a widespread disease associated with eight diagnostic classes. The diagnosis of multiple types of skin cancer is a challenging task for dermatologists due to the similarity of skin cancer classes in phenotype. The average accuracy of multiclass skin cancer diagnosis is 62% to 80%. Therefore, the classification of skin cancer using machine learning can be beneficial in the diagnosis and treatment of the patients. Several researchers developed skin cancer classification models for binary class but could not extend the research to multiclass classification with better performance ratios. We have developed deep learning-based ensemble classification models for multiclass skin cancer classification. Experimental results proved that the individual deep learners perform better for skin cancer classification, but still the development of ensemble is a meaningful approach since it enhances the classification accuracy. Results show that the accuracy of individual learners of ResNet, InceptionV3, DenseNet, InceptionResNetV2, and VGG-19 are 72%, 91%, 91.4%, 91.7% and 91.8%, respectively. The accuracy of proposed majority voting and weighted majority voting ensemble models are 98% and 98.6%, respectively. The accuracy of proposed ensemble models is higher than the individual deep learners and the dermatologists’ diagnosis accuracy. The proposed ensemble models are compared with the recently developed skin cancer classification approaches. The results show that the proposed ensemble models outperform recently developed multiclass skin cancer classification models.

Particle swarm optimization (PSO) algorithm is a population‐based intelligent stochastic search technique used to search for food with the intrinsic manner of bee swarming. PSO is widely used to solve the diverse problems of optimization. Initialization of population is a critical factor in the PSO algorithm, which considerably influences the diversity and convergence during the process of PSO. Quasirandom sequences are useful for initializing the population to improve the diversity and convergence, rather than applying the random distribution for initialization. The performance of PSO is expanded in this paper to make it appropriate for the optimization problem by introducing a new initialization technique named WELL with the help of low‐discrepancy sequence. To solve the optimization problems in large‐dimensional search spaces, the proposed solution is termed as WE‐PSO. The suggested solution has been verified on fifteen well‐known unimodal and multimodal benchmark test problems extensively used in the literature, Moreover, the performance of WE‐PSO is compared with the standard PSO and two other initialization approaches Sobol‐based PSO (SO‐PSO) and Halton‐based PSO (H‐PSO). The findings indicate that WE‐PSO is better than the standard multimodal problem‐solving techniques. The results validate the efficacy and effectiveness of our approach. In comparison, the proposed approach is used for artificial neural network (ANN) learning and contrasted to the standard backpropagation algorithm, standard PSO, H‐PSO, and SO‐PSO, respectively. The results of our technique has a higher accuracy score and outperforms traditional methods. Also, the outcome of our work presents an insight on how the proposed initialization technique has a high effect on the quality of cost function, integration, and diversity aspects.

Mobile ad hoc networks (MANETs) are self-organized networks without any fixed infrastructure. The topology changes are very frequent in MANETs due to nodes' mobility. The topology maintenance creates an extra overhead, as the mobility information of a single node is shared with all nodes in the network. To address the topology maintenance overhead problem in MANETs, the researchers proposed different cluster-based algorithms to reduce the size of a routing table. The clusters are formed to locally adjust the topology changes within the cluster. If a node wants to communicate with a node outside the cluster, it only communicates with its cluster head (CH). The CH communicates with other CHs to transmit data toward the destination. To efficiently utilize the clustering mechanism in MANETs, stable and balanced clusters are required. To form good quality and optimized clusters, some metrics, such as relative mobility (node speed and direction), node degree, residual energy, communication workload, and neighbor's behavior, are required. In this paper, we present a comprehensive survey of recent CAs in MANETs. We also present the objectives, goals, and contributions of recent research. Similarly, the findings, challenges, and future directions are stated. The validation of each proposed work is analyzed critically in terms of the mobility model, the simulation tool used during simulation, simulation metrics, and the performance metrics used in the validation process.

In wireless sensor networks for the Internet of Things (WSN‐IoT), the topology deviates very frequently because of the node mobility. The topology maintenance overhead is high in flat‐based WSN‐IoTs. WSN clustering is suggested to not only reduce the message overhead in WSN‐IoT but also control the congestion and easy topology repairs. The partition of wireless mobile nodes (WMNs) into clusters is a multiobjective optimization problem in large‐size WSN. Different evolutionary algorithms (EAs) are applied to divide the WSN‐IoT into clusters but suffer from early convergence. In this paper, we propose WSN clustering based on the memetic algorithm (MemA) to decrease the probability of early convergence by utilizing local exploration techniques. Optimum clusters in WSN‐IoT can be obtained using MemA to dynamically balance the load among clusters. The objective of this research is to find a cluster head set (CH‐set) as early as possible once needed. The WMNs with high weight value are selected in lieu of new inhabitants in the subsequent generation. A crossover mechanism is applied to produce new‐fangled chromosomes as soon as the two maternities have been nominated. The local search procedure is initiated to enhance the worth of individuals. The suggested method is matched with state‐of‐the‐art methods like MobAC (Singh and Lohani, 2019), EPSO‐C (Pathak, 2020), and PBC‐CP (Vimalarani, et al. 2016). The proposed technique outperforms the state of the art clustering methods regarding control messages overhead, cluster count, reaffiliation rate, and cluster lifetime.