Particle swarm optimization (PSO) is one of the most well-regarded swarm-based algorithms in the literature. Although the original PSO has shown good optimization performance, it still severely suffers from premature convergence. As a result, many researchers have been modifying it resulting in a large number of PSO variants with either slightly or significantly better performance. Mainly, the standard PSO has been modified by four main strategies: modification of the PSO controlling parameters, hybridizing PSO with other well-known meta-heuristic algorithms such as genetic algorithm (GA) and differential evolution (DE), cooperation and multi-swarm techniques. This paper attempts to provide a comprehensive review of PSO, including the basic concepts of PSO, binary PSO, neighborhood topologies in PSO, recent and historical PSO variants, remarkable engineering applications of PSO, and its drawbacks. Moreover, this paper reviews recent studies that utilize PSO to solve feature selection problems. Finally, eight potential research directions that can help researchers further enhance the performance of PSO are provided. 

Particle Swarm Optimization: A Comprehensive Survey

A Levy Flight motivated meta-heuristic approach for enhancing maximum loadability limit in practical power system

MANET (mobile ad-hoc networks) are distributed or delegated away from a central server, authoritative location of wireless networks that communicate without pre-existing structure. Ad-hoc networks are compromising the many types of attacks and routing. In MANET, routing plays a vital role in terms of packets interaction and data transmission. Due to decentralized control, the MANET data transmission becomes insecure because of dispersed routing on the mobile ad-hoc nodes. Since the efficient route on MANET only controls the packets and does not simplify the route between the source to the destination, the maintenance of route interaction becomes a crucial process. Maintain effective data transactions over the MANET network, and it is essential to improve the route and locate the attacker. Nevertheless, MANET allows for route interaction against security threads. In this research article, four processing schemes are suggested to preserve the security measures against routing protocols. Especially in node communication, the rushing attacker has a significant impact on packet-based data transmission in MANET.Also, for this research, an Attacker detection automation of the bees colony optimization (ADABCP) method is used. The desired result is brought about in the effective attacker detection on the routing process. Moreover, the proposed hybrid random late detection (HRLD) routing protocol manages the MANET routing and overcomes the MANET congestion communication. The Swift implicit response round trip time (SIRT) mechanism is generated by the route finding manipulation (RFM) to enhance the performance. This RFM scheme helps to find the optimal routing in a secured manner. The proposed (SIRT-ADABCP-HRLD) approach was compared to the existing ESCT, ZRDM-LFPM, and ENM-LAC approaches, found to have improved by routing and data transmission. Compared to the conventional method, the method mentioned above achieves a better ratio for the end-to-end delay, communication overhead, packet delivery ratio, network lifetime, and energy consumption.

/pdf/intelligent-route-discovery-towards-rushing-attacks-in-ad-4a2u2zsemp.pdf

Intelligent route discovery towards rushing attacks in ad hoc wireless networks

LBR-GWO: Layered based routing approach using grey wolf optimization algorithm in wireless sensor networks

In this paper, we propose a hierarchical topological-based auto-configuration scheme for MANETs providing global internet connectivity among leader and member nodes to reduce the control overhead. The proposed scheme has performed the duplication address detection (DAD) operation through selecting a pre-configured node called coordinator node by a new joining cluster node. Hence, the overhead is reduced by the elimination of DAD messages broadcasting in the whole network. Also, the clustering problem in MANETs is solved by introducing a new adaptive particle swarm optimization with multiple velocity strategy (APSO-MVS) algorithm for a new leader selection with the frequent departure and failure of a leader node. However, to enhance the robustness and global searching ability of classical PSO, the three new velocity updating strategies are used in a newly developed APSO-MVS algorithm. This proposed APSO-MVS algorithm has considered multiple node metrics (node distance from the cluster group centre, node speed and node density) for the selection of an optimal leader node. Simulation results have proved the efficacy of proposed protocol in overhead reduction compared to other existing auto-configuration protocols and in terms of 15 benchmark test functions.

R. A. Samuel

Papers

APSO-MVS: an adaptive particle swarm optimization incorporating multiple velocity strategies for optimal leader selection in hybrid MANETs