An Improved Multi-Objective Particle Swarm Optimization Routing on MANET

A Mobile Ad hoc Network(MANET)is a group of low-power con-sumption of wireless mobile nodes that configure a wireless network without the assistance of any existing infrastructure/centralized organization.The primary aim of MANETs is to extendflexibility into the self-directed,mobile,and wireless domain,in which a cluster of autonomous nodes forms a MANET routing system.An Intrusion Detection System(IDS)is a tool that examines a network for mal-icious behavior/policy violations.A network monitoring system is often used to report/gather any suspicious attacks/violations.An IDS is a software program or hardware system that monitors network/security traffic for malicious attacks,sending out alerts whenever it detects malicious nodes.The impact of Dynamic Source Routing(DSR)in MANETs challenging blackhole attack is investigated in this research article.The Cluster Trust Adaptive Acknowledgement(CTAA)method is used to identify unauthorised and malfunctioning nodes in a MANET environment.MANET system is active and provides successful delivery of a data packet,which implements Kalman Filters(KF)to anticipate node trustworthiness.Furthermore,KF is used to eliminate synchronisation errors that arise during the sending and receiving data.In order to provide an energy-efficient solution and to minimize network traffic,route optimization in MANET by using Multi-Objective Particle Swarm Optimization(MOPSO)technique to determine the optimal num-ber of clustered MANET along with energy dissipation in nodes.According to the researchfindings,the proposed CTAA-MPSO achieves a Packet Delivery Ratio(PDR)of 3.3%.In MANET,the PDR of CTAA-MPSO improves CTAA-PSO by 3.5%at 30%malware.

Optimal Location and Sizing of Distributed Generator via Improved Multi-Objective Particle Swarm Optimization in Active Distribution Network Considering Multi-Resource

In the framework of vigorous promotion of low-carbon power system growth as well as economic globalization,multi-resource penetration in active distribution networks has been advancing fiercely.In particular,distributed generation(DG)based on renewable energy is critical for active distribution network operation enhancement.To comprehensively analyze the accessing impact of DG in distribution networks from various parts,this paper establishes an optimal DG location and sizing planning model based on active power losses,voltage profile,pollution emissions,and the economics of DG costs as well as meteorological conditions.Subsequently,multiobjective particle swarm optimization(MOPSO)is applied to obtain the optimal Pareto front.Besides,for the sake of avoiding the influence of the subjective setting of the weight coefficient,the decisionmethod based on amodified ideal point is applied to execute a Pareto front decision.Finally,simulation tests based on IEEE33 and IEEE69 nodes are designed.The experimental results show thatMOPSO can achieve wider and more uniformPareto front distribution.In the IEEE33 node test system,power loss,and voltage deviation decreased by 52.23%,and 38.89%,respectively,while taking the economy into account.In the IEEE69 test system,the three indexes decreased by 19.67%,and 58.96%,respectively.

A modified multi-objective particle swarm optimization approach and its application to the design of a deepwater composite riser

A modified multi-objective particle swarm optimization method is proposed for obtaining Pareto-optimal solutions effectively. Different from traditional multiobjective particle swarm optimization methods, Kriging meta-models and the trapezoid index are introduced and integrated with the traditional one. Kriging meta-models are built to match expensive or black-box functions. By applying Kriging meta-models, function evaluation numbers are decreased and the boundary Pareto-optimal solutions are identified rapidly. For bi-objective optimization problems, the trapezoid index is calculated as the sum of the trapezoid’s area formed by the Pareto-optimal solutions and one objective axis. It can serve as a measure whether the Pareto-optimal solutions converge to the Pareto front. Illustrative examples indicate that to obtain Paretooptimal solutions, the method proposed needs fewer function evaluations than the traditional multi-objective particle swarm optimization method and the non-dominated sorting genetic algorithm II method, and both the accuracy and the computational efficiency are improved. The proposed method is also applied to the design of a deepwater composite riser example in which the structural performances are calculated by numerical analysis. The design aim was to enhance the tension strength and minimize the cost. Under the buckling constraint, the optimal trade-off of tensile strength and material volume is obtained. The results demonstrated that the proposed method can effec tively deal with multi-objective optimizations with black-box functions.

Research on Optimization of Freight Train ATO Based on Elite Competition Multi-Objective Particle Swarm Optimization

In view of the complex problems that freight train ATO (automatic train operation) needs to comprehensively consider punctuality, energy saving and safety, a dynamics model of the freight train operation process is established based on the safety and the freight train dynamics model in the process of its operation. The algorithm of combining elite competition strategy with multi-objective particle swarm optimization technology is introduced, and the winning particles are obtained through the competition between two elite particles to guide the update of other particles, so as to balance the convergence and distribution of multi-objective particle swarm optimization. The performance comparison experimental results verify the superiority of the proposed algorithm. The simulation experiments of the actual line verify the feasibility of the model and the effectiveness of the proposed algorithm.

Rotary unmanned aerial vehicles path planning in rough terrain based on multi-objective particle swarm optimization

This paper presents a path planning approach for rotary unmanned aerial vehicles(R-UAVs)in a known static rough terrain environment.This approach aims to find collision-free and feasible paths with minimum altitude,length and angle variable rate.First,a three-dimensional(3D)modeling method is proposed to reduce the computation burden of the dynamic models of R-UAVs.Considering the length,height and tuning angle of a path,the path planning of R-UAVs is described as a tri-objective optimization problem.Then,an improved multi-objective particle swarm optimization algorithm is developed.To render the algorithm more effective in dealing with this problem,a vibration function is introduced into the collided solutions to improve the algorithm efficiency.Meanwhile,the selection of the global best position is taken into account by the reference point method.Finally,the experimental environment is built with the help of the Google map and the 3D terrain generator World Machine.Experimental results under two different rough terrains from Guilin and Lanzhou of China demonstrate the capabilities of the proposed algorithm in finding Pareto optimal paths.

An Improved Unsupervised Image Segmentation Method Based on Multi-Objective Particle Swarm Optimization Clustering Algorithm

Most image segmentation methods based on clustering algorithms use singleobjective function to implement image segmentation.To avoid the defect,this paper proposes a new image segmentation method based on a multi-objective particle swarm optimization(PSO)clustering algorithm.This unsupervised algorithm not only offers a new similarity computing approach based on electromagnetic forces,but also obtains the proper number of clusters which is determined by scale-space theory.It is experimentally demonstrated that the applicability and effectiveness of the proposed multi-objective PSO clustering algorithm.

Power system stabilizer design using hybrid multi-objective particle swarm optimization with chaos

A novel technique for the optimal tuning of power system stabilizer (PSS) was proposed,by integrating the modified particle swarm optimization (MPSO) with the chaos (MPSOC).Firstly,a modification in the particle swarm optimization (PSO) was made by introducing passive congregation (PC).It helps each swarm member in receiving a multitude of information from other members and thus decreases the possibility of a failed attempt at detection or a meaningless search.Secondly,the MPSO and chaos were hybridized (MPSOC) to improve the global searching capability and prevent the premature convergence due to local minima.The robustness of the proposed PSS tuning technique was verified on a multi-machine power system under different operating conditions.The performance of the proposed MPSOC was compared to the MPSO,PSO and GA through eigenvalue analysis,nonlinear time-domain simulation and statistical tests.Eigenvalue analysis shows acceptable damping of the low-frequency modes and time domain simulations also show that the oscillations of synchronous machines can be rapidly damped for power systems with the proposed PSSs.The results show that the presented algorithm has a faster convergence rate with higher degree of accuracy than the GA,PSO and MPSO.

Optimization of the Hydrological Model Using Multi-objective Particle Swarm Optimization Algorithm

An application of multi-objective particle swarm optimization(MOPSO) algorithm for optimization of the hydrological model(HYMOD) is presented in this paper.MOPSO algorithm is used to find non-dominated solutions with two objectives: high flow Nash-Sutcliffe efficiency and low flow Nash-Sutcliffe efficiency.The two sets' coverage rate and Pareto front spacing metric are two criterions to analyze the performance of the algorithms.MOPSO algorithm surpasses multi-objective shuffled complex evolution metropolis(MOSCEM_UA) algorithm in terms of the two sets' coverage rate.But when we come to Pareto front spacing rate,the non-dominated solutions of MOSCEM_UA algorithm are better-distributed than that of MOPSO algorithm when the iteration is set to 40000.In addition,there are obvious conflicts between the two objectives.But a compromise solution can be acquired by adopting the MOPSO algorithm.

Operation Optimal Control of Urban Rail Train Based on Multi-Objective Particle Swarm Optimization

The energy consumption of train operation occupies a large proportion of the total consumption of railway transportation.In order to improve the oper-ating energy utilization rate of trains,a multi-objective particle swarm optimiza-tion(MPSO)algorithm with energy consumption,punctuality and parking accuracy as the objective and safety as the constraint is built.To accelerate its the convergence process,the train operation progression is divided into several modes according to the train speed-distance curve.A human-computer interactive particle swarm optimization algorithm is proposed,which presents the optimized results after a certain number of iterations to the decision maker,and the satisfac-tory outcomes can be obtained after a limited number of adjustments.The multi-objective particle swarm optimization(MPSO)algorithm is used to optimize the train operation process.An algorithm based on the important relationship between the objective and the preference information of the given reference points is sug-gested to overcome the shortcomings of the existing algorithms.These methods significantly increase the computational complexity and convergence of the algo-rithm.An adaptive fuzzy logic system that can simultaneously utilize experience information andfield data information is proposed to adjust the consequences of off-line optimization in real time,thereby eliminating the influence of uncertainty on train operation.After optimization and adjustment,the whole running time has been increased by 0.5 s,the energy consumption has been reduced by 12%,the parking accuracy has been increased by 8%,and the comprehensive performance has been enhanced.

Multi-objective particle swarm optimization algorithm using Cauchy mutation and improved crowding distance

Purpose-Multi-objective is a complex problem that appears in real life while these objectives are conflicting.The swarm intelligence algorithm is often used to solve such multi-objective problems.Due to its strong search ability and convergence ability,particle swarm optimization algorithm is proposed,and the multi-objective particle swarm optimization algorithm is used to solve multi-objective optimization problems.However,the particles of particle swarm optimization algorithm are easy to fall into local optimization because of their fast convergence.Uneven distribution and poor diversity are the two key drawbacks of the Pareto front of multi-objective particle swarm optimization algorithm.Therefore,this paper aims to propose an improved multi-objective particle swarm optimization algorithm using adaptive Cauchy mutation and improved crowding distance.Design/methodology/approach-In this paper,the proposed algorithm uses adaptive Cauchy mutation and improved crowding distance to perturb the particles in the population in a dynamic way in order to help the particles trapped in the local optimization jump out of it which improves the convergence performance consequently.Findings-In order to solve the problems of uneven distribution and poor diversity in the Pareto front of multi-objective particle swarm optimization algorithm,this paper uses adaptive Cauchy mutation and improved crowding distance to help the particles trapped in the local optimization jump out of the local optimization.Experimental results show that the proposed algorithm has obvious advantages in convergence performance for nine benchmark functions compared with other multi-objective optimization algorithms.Originality/value-In order to help the particles trapped in the local optimization jump out of the local optimization which improves the convergence performance consequently,this paper proposes an improved multi-objective particle swarm optimization algorithm using adaptive Cauchy mutation and improved crowding distance.

Determination of the Pile Drivability Using Random Forest Optimized by Particle Swarm Optimization and Bayesian Optimizer

Driven piles are used in many geological environments as a practical and convenient structural component.Hence,the determination of the drivability of piles is actually of great importance in complex geotechnical applications.Conventional methods of predicting pile drivability often rely on simplified physicalmodels or empirical formulas,whichmay lack accuracy or applicability in complex geological conditions.Therefore,this study presents a practical machine learning approach,namely a Random Forest(RF)optimized by Bayesian Optimization(BO)and Particle Swarm Optimization(PSO),which not only enhances prediction accuracy but also better adapts to varying geological environments to predict the drivability parameters of piles(i.e.,maximumcompressive stress,maximum tensile stress,and blow per foot).In addition,support vector regression,extreme gradient boosting,k nearest neighbor,and decision tree are also used and applied for comparison purposes.In order to train and test these models,among the 4072 datasets collected with 17model inputs,3258 datasets were randomly selected for training,and the remaining 814 datasets were used for model testing.Lastly,the results of these models were compared and evaluated using two performance indices,i.e.,the root mean square error(RMSE)and the coefficient of determination(R2).The results indicate that the optimized RF model achieved lower RMSE than other prediction models in predicting the three parameters,specifically 0.044,0.438,and 0.146;and higher R2 values than other implemented techniques,specifically 0.966,0.884,and 0.977.In addition,the sensitivity and uncertainty of the optimized RF model were analyzed using Sobol sensitivity analysis and Monte Carlo(MC)simulation.It can be concluded that the optimized RF model could be used to predict the performance of the pile,and it may provide a useful reference for solving some problems under similar engineering conditions.

A Proposed Feature Selection Particle Swarm Optimization Adaptation for Intelligent Logistics--A Supply Chain Backlog Elimination Framework

The diversity of data sources resulted in seeking effective manipulation and dissemination.The challenge that arises from the increasing dimensionality has a negative effect on the computation performance,efficiency,and stability of computing.One of the most successful optimization algorithms is Particle Swarm Optimization(PSO)which has proved its effectiveness in exploring the highest influencing features in the search space based on its fast convergence and the ability to utilize a small set of parameters in the search task.This research proposes an effective enhancement of PSO that tackles the challenge of randomness search which directly enhances PSO performance.On the other hand,this research proposes a generic intelligent framework for early prediction of orders delay and eliminate orders backlogs which could be considered as an efficient potential solution for raising the supply chain performance.The proposed adapted algorithm has been applied to a supply chain dataset which minimized the features set from twenty-one features to ten significant features.To confirm the proposed algorithm results,the updated data has been examined by eight of the well-known classification algorithms which reached a minimum accuracy percentage equal to 94.3%for random forest and a maximum of 99.0 for Naïve Bayes.Moreover,the proposed algorithm adaptation has been compared with other proposed adaptations of PSO from the literature over different datasets.The proposed PSO adaptation reached a higher accuracy compared with the literature ranging from 97.8 to 99.36 which also proved the advancement of the current research.

True-temperature inversion algorithm for a multi-wavelength pyrometer based on fractional-order particle-swarm optimization

Herein,a method of true-temperature inversion for a multi-wavelength pyrometer based on fractional-order particle-swarm optimization is proposed for difficult inversion problems with unknown emissivity.Fractional-order calculus has the inherent advantage of easily jumping out of local extreme values;here,it is introduced into the particle-swarm algorithm to invert the true temperature.An improved adaptive-adjustment mechanism is applied to automatically adjust the current velocity order of the particles and update their velocity and position values,increasing the accuracy of the true temperature values.The results of simulations using the proposed algorithm were compared with three algorithms using typical emissivity models:the internal penalty function algorithm,the optimization function(fmincon)algorithm,and the conventional particle-swarm optimization algorithm.The results show that the proposed algorithm has good accuracy for true-temperature inversion.Actual experimental results from a rocket-motor plume were used to demonstrate that the true-temperature inversion results of this algorithm are in good agreement with the theoretical true-temperature values.

Using Improved Particle Swarm Optimization Algorithm for Location Problem of Drone Logistics Hub

Drone logistics is a novel method of distribution that will become prevalent.The advantageous location of the logistics hub enables quicker customer deliveries and lower fuel consumption,resulting in cost savings for the company’s transportation operations.Logistics firms must discern the ideal location for establishing a logistics hub,which is challenging due to the simplicity of existing models and the intricate delivery factors.To simulate the drone logistics environment,this study presents a new mathematical model.The model not only retains the aspects of the current models,but also considers the degree of transportation difficulty from the logistics hub to the village,the capacity of drones for transportation,and the distribution of logistics hub locations.Moreover,this paper proposes an improved particle swarm optimization(PSO)algorithm which is a diversity-based hybrid PSO(DHPSO)algorithm to solve this model.In DHPSO,the Gaussian random walk can enhance global search in the model space,while the bubble-net attacking strategy can speed convergence.Besides,Archimedes spiral strategy is employed to overcome the local optima trap in the model and improve the exploitation of the algorithm.DHPSO maintains a balance between exploration and exploitation while better defining the distribution of logistics hub locations Numerical experiments show that the newly proposed model always achieves better locations than the current model.Comparing DHPSO with other state-of-the-art intelligent algorithms,the efficiency of the scheme can be improved by 42.58%.This means that logistics companies can reduce distribution costs and consumers can enjoy a more enjoyable shopping experience by using DHPSO’s location selection.All the results show the location of the drone logistics hub is solved by DHPSO effectively.

Identifying influential spreaders in social networks: A two-stage quantum-behaved particle swarm optimization with Lévy flight

The influence maximization problem aims to select a small set of influential nodes, termed a seed set, to maximize their influence coverage in social networks. Although the methods that are based on a greedy strategy can obtain good accuracy, they come at the cost of enormous computational time, and are therefore not applicable to practical scenarios in large-scale networks. In addition, the centrality heuristic algorithms that are based on network topology can be completed in relatively less time. However, they tend to fail to achieve satisfactory results because of drawbacks such as overlapped influence spread. In this work, we propose a discrete two-stage metaheuristic optimization combining quantum-behaved particle swarm optimization with Lévy flight to identify a set of the most influential spreaders. According to the framework,first, the particles in the population are tasked to conduct an exploration in the global solution space to eventually converge to an acceptable solution through the crossover and replacement operations. Second, the Lévy flight mechanism is used to perform a wandering walk on the optimal candidate solution in the population to exploit the potentially unidentified influential nodes in the network. Experiments on six real-world social networks show that the proposed algorithm achieves more satisfactory results when compared to other well-known algorithms.

Comparison of debris flow susceptibility assessment methods:support vector machine,particle swarm optimization,and feature selection techniques

The selection of important factors in machine learning-based susceptibility assessments is crucial to obtain reliable susceptibility results.In this study,metaheuristic optimization and feature selection techniques were applied to identify the most important input parameters for mapping debris flow susceptibility in the southern mountain area of Chengde City in Hebei Province,China,by using machine learning algorithms.In total,133 historical debris flow records and 16 related factors were selected.The support vector machine(SVM)was first used as the base classifier,and then a hybrid model was introduced by a two-step process.First,the particle swarm optimization(PSO)algorithm was employed to select the SVM model hyperparameters.Second,two feature selection algorithms,namely principal component analysis(PCA)and PSO,were integrated into the PSO-based SVM model,which generated the PCA-PSO-SVM and FS-PSO-SVM models,respectively.Three statistical metrics(accuracy,recall,and specificity)and the area under the receiver operating characteristic curve(AUC)were employed to evaluate and validate the performance of the models.The results indicated that the feature selection-based models exhibited the best performance,followed by the PSO-based SVM and SVM models.Moreover,the performance of the FS-PSO-SVM model was better than that of the PCA-PSO-SVM model,showing the highest AUC,accuracy,recall,and specificity values in both the training and testing processes.It was found that the selection of optimal features is crucial to improving the reliability of debris flow susceptibility assessment results.Moreover,the PSO algorithm was found to be not only an effective tool for hyperparameter optimization,but also a useful feature selection algorithm to improve prediction accuracies of debris flow susceptibility by using machine learning algorithms.The high and very high debris flow susceptibility zone appropriately covers 38.01%of the study area,where debris flow may occur under intensive human activities and heavy rainfall events.

Fitness Sharing Chaotic Particle Swarm Optimization (FSCPSO): A Metaheuristic Approach for Allocating Dynamic Virtual Machine (VM) in Fog Computing Architecture

In recent decades,fog computing has played a vital role in executing parallel computational tasks,specifically,scientific workflow tasks.In cloud data centers,fog computing takes more time to run workflow applications.Therefore,it is essential to develop effective models for Virtual Machine(VM)allocation and task scheduling in fog computing environments.Effective task scheduling,VM migration,and allocation,altogether optimize the use of computational resources across different fog nodes.This process ensures that the tasks are executed with minimal energy consumption,which reduces the chances of resource bottlenecks.In this manuscript,the proposed framework comprises two phases:(i)effective task scheduling using a fractional selectivity approach and(ii)VM allocation by proposing an algorithm by the name of Fitness Sharing Chaotic Particle Swarm Optimization(FSCPSO).The proposed FSCPSO algorithm integrates the concepts of chaos theory and fitness sharing that effectively balance both global exploration and local exploitation.This balance enables the use of a wide range of solutions that leads to minimal total cost and makespan,in comparison to other traditional optimization algorithms.The FSCPSO algorithm’s performance is analyzed using six evaluation measures namely,Load Balancing Level(LBL),Average Resource Utilization(ARU),total cost,makespan,energy consumption,and response time.In relation to the conventional optimization algorithms,the FSCPSO algorithm achieves a higher LBL of 39.12%,ARU of 58.15%,a minimal total cost of 1175,and a makespan of 85.87 ms,particularly when evaluated for 50 tasks.

Hybrid Hierarchical Particle Swarm Optimization with Evolutionary Artificial Bee Colony Algorithm for Task Scheduling in Cloud Computing

Task scheduling plays a key role in effectively managing and allocating computing resources to meet various computing tasks in a cloud computing environment.Short execution time and low load imbalance may be the challenges for some algorithms in resource scheduling scenarios.In this work,the Hierarchical Particle Swarm Optimization-Evolutionary Artificial Bee Colony Algorithm(HPSO-EABC)has been proposed,which hybrids our presented Evolutionary Artificial Bee Colony(EABC),and Hierarchical Particle Swarm Optimization(HPSO)algorithm.The HPSO-EABC algorithm incorporates both the advantages of the HPSO and the EABC algorithm.Comprehensive testing including evaluations of algorithm convergence speed,resource execution time,load balancing,and operational costs has been done.The results indicate that the EABC algorithm exhibits greater parallelism compared to the Artificial Bee Colony algorithm.Compared with the Particle Swarm Optimization algorithm,the HPSO algorithmnot only improves the global search capability but also effectively mitigates getting stuck in local optima.As a result,the hybrid HPSO-EABC algorithm demonstrates significant improvements in terms of stability and convergence speed.Moreover,it exhibits enhanced resource scheduling performance in both homogeneous and heterogeneous environments,effectively reducing execution time and cost,which also is verified by the ablation experimental.

Improved Particle Swarm Optimization for Parameter Identification of Permanent Magnet Synchronous Motor

In the process of identifying parameters for a permanent magnet synchronous motor,the particle swarm optimization method is prone to being stuck in local optima in the later stages of iteration,resulting in low parameter accuracy.This work proposes a fuzzy particle swarm optimization approach based on the transformation function and the filled function.This approach addresses the topic of particle swarmoptimization in parameter identification from two perspectives.Firstly,the algorithm uses a transformation function to change the form of the fitness function without changing the position of the extreme point of the fitness function,making the extreme point of the fitness function more prominent and improving the algorithm’s search ability while reducing the algorithm’s computational burden.Secondly,on the basis of themulti-loop fuzzy control systembased onmultiplemembership functions,it is merged with the filled function to improve the algorithm’s capacity to skip out of the local optimal solution.This approach can be used to identify the parameters of permanent magnet synchronous motors by sampling only the stator current,voltage,and speed data.The simulation results show that the method can effectively identify the electrical parameters of a permanent magnet synchronous motor,and it has superior global convergence performance and robustness.

Accelerated Particle Swarm Optimization Algorithm for Efficient Cluster Head Selection in WSN

Numerous wireless networks have emerged that can be used for short communication ranges where the infrastructure-based networks may fail because of their installation and cost.One of them is a sensor network with embedded sensors working as the primary nodes,termed Wireless Sensor Networks(WSNs),in which numerous sensors are connected to at least one Base Station(BS).These sensors gather information from the environment and transmit it to a BS or gathering location.WSNs have several challenges,including throughput,energy usage,and network lifetime concerns.Different strategies have been applied to get over these restrictions.Clustering may,therefore,be thought of as the best way to solve such issues.Consequently,it is crucial to analyze effective Cluster Head(CH)selection to maximize efficiency throughput,extend the network lifetime,and minimize energy consumption.This paper proposed an Accelerated Particle Swarm Optimization(APSO)algorithm based on the Low Energy Adaptive Clustering Hierarchy(LEACH),Neighboring Based Energy Efficient Routing(NBEER),Cooperative Energy Efficient Routing(CEER),and Cooperative Relay Neighboring Based Energy Efficient Routing(CR-NBEER)techniques.With the help of APSO in the implementation of the WSN,the main methodology of this article has taken place.The simulation findings in this study demonstrated that the suggested approach uses less energy,with respective energy consumption ranges of 0.1441 to 0.013 for 5 CH,1.003 to 0.0521 for 10 CH,and 0.1734 to 0.0911 for 15 CH.The sending packets ratio was also raised for all three CH selection scenarios,increasing from 659 to 1730.The number of dead nodes likewise dropped for the given combination,falling between 71 and 66.The network lifetime was deemed to have risen based on the results found.A hybrid with a few valuable parameters can further improve the suggested APSO-based protocol.Similar to underwater,WSN can make use of the proposed protocol.The overall results have been evaluated and compared with the existing approaches of sensor networks.