The massive influx of traffic on the Internet has made the composition of web traffic increasingly complex.Traditional port-based or protocol-based network traffic identification methods are no longer suitable for to...The massive influx of traffic on the Internet has made the composition of web traffic increasingly complex.Traditional port-based or protocol-based network traffic identification methods are no longer suitable for today’s complex and changing networks.Recently,machine learning has beenwidely applied to network traffic recognition.Still,high-dimensional features and redundant data in network traffic can lead to slow convergence problems and low identification accuracy of network traffic recognition algorithms.Taking advantage of the faster optimizationseeking capability of the jumping spider optimization algorithm(JSOA),this paper proposes a jumping spider optimization algorithmthat incorporates the harris hawk optimization(HHO)and small hole imaging(HHJSOA).We use it in network traffic identification feature selection.First,the method incorporates the HHO escape energy factor and the hard siege strategy to forma newsearch strategy for HHJSOA.This location update strategy enhances the search range of the optimal solution of HHJSOA.We use small hole imaging to update the inferior individual.Next,the feature selection problem is coded to propose a jumping spiders individual coding scheme.Multiple iterations of the HHJSOA algorithmfind the optimal individual used as the selected feature for KNN classification.Finally,we validate the classification accuracy and performance of the HHJSOA algorithm using the UNSW-NB15 dataset and KDD99 dataset.Experimental results show that compared with other algorithms for the UNSW-NB15 dataset,the improvement is at least 0.0705,0.00147,and 1 on the accuracy,fitness value,and the number of features.In addition,compared with other feature selectionmethods for the same datasets,the proposed algorithmhas faster convergence,better merit-seeking,and robustness.Therefore,HHJSOAcan improve the classification accuracy and solve the problem that the network traffic recognition algorithm needs to be faster to converge and easily fall into local optimum due to high-dimensional features.展开更多
As a new bionic algorithm,Spider Monkey Optimization(SMO)has been widely used in various complex optimization problems in recent years.However,the new space exploration power of SMO is limited and the diversity of the...As a new bionic algorithm,Spider Monkey Optimization(SMO)has been widely used in various complex optimization problems in recent years.However,the new space exploration power of SMO is limited and the diversity of the population in SMO is not abundant.Thus,this paper focuses on how to reconstruct SMO to improve its performance,and a novel spider monkey optimization algorithm with opposition-based learning and orthogonal experimental design(SMO^(3))is developed.A position updatingmethod based on the historical optimal domain and particle swarmfor Local Leader Phase(LLP)andGlobal Leader Phase(GLP)is presented to improve the diversity of the population of SMO.Moreover,an opposition-based learning strategy based on self-extremum is proposed to avoid suffering from premature convergence and getting stuck at locally optimal values.Also,a local worst individual elimination method based on orthogonal experimental design is used for helping the SMO algorithm eliminate the poor individuals in time.Furthermore,an extended SMO^(3)named CSMO^(3)is investigated to deal with constrained optimization problems.The proposed algorithm is applied to both unconstrained and constrained functions which include the CEC2006 benchmark set and three engineering problems.Experimental results show that the performance of the proposed algorithm is better than three well-known SMO algorithms and other evolutionary algorithms in unconstrained and constrained problems.展开更多
To solve the problem of slow convergence and easy to get into the local optimum of the spider monkey optimization algorithm,this paper presents a new algorithm based on multi-strategy(ISMO).First,the initial populatio...To solve the problem of slow convergence and easy to get into the local optimum of the spider monkey optimization algorithm,this paper presents a new algorithm based on multi-strategy(ISMO).First,the initial population is generated by a refracted opposition-based learning strategy to enhance diversity and ergodicity.Second,this paper introduces a non-linear adaptive dynamic weight factor to improve convergence efficiency.Then,using the crisscross strategy,using the horizontal crossover to enhance the global search and vertical crossover to keep the diversity of the population to avoid being trapped in the local optimum.At last,we adopt a Gauss-Cauchy mutation strategy to improve the stability of the algorithm by mutation of the optimal individuals.Therefore,the application of ISMO is validated by ten benchmark functions and feature selection.It is proved that the proposed method can resolve the problem of feature selection.展开更多
Due to the drastic increase in global population as well as economy,electricity demand becomes considerably high.The recently developed smart grid(SG)technology has the ability to minimize power loss at the time of po...Due to the drastic increase in global population as well as economy,electricity demand becomes considerably high.The recently developed smart grid(SG)technology has the ability to minimize power loss at the time of power distribution.Machine learning(ML)and deep learning(DL)models can be effectually developed for the design of SG stability techniques.This article introduces a new Social Spider Optimization with Deep Learning Enabled Statistical Analysis for Smart Grid Stability(SSODLSA-SGS)pre-diction model.Primarily,class imbalance data handling process is performed using Synthetic minority oversampling technique(SMOTE)technique.The SSODLSA-SGS model involves two stages of pre-processing namely data nor-malization and transformation.Besides,the SSODLSA-SGS model derives a deep belief-back propagation neural network(DBN-BN)model for the pre-diction of SG stability.Finally,social spider optimization(SSO)algorithm can be applied for determining the optimal hyperparameter values of the DBN-BN model.The design of SSO algorithm helps to appropriately modify the hyperparameter values of the DBN-BN model.A series of simulation analyses are carried out to highlight the enhanced outcomes of the SSODLSA-SGS model.The extensive comparative study reported the enhanced performance of the SSODLSA-SGS algorithm over the other recent techniques interms of several measures.展开更多
This paper presents the speed control of a separately excited DC motor using Neural Network (NN) controller in field weakening region. In armature control, speed controller has been used in outer loop while current co...This paper presents the speed control of a separately excited DC motor using Neural Network (NN) controller in field weakening region. In armature control, speed controller has been used in outer loop while current controller in inner loop is used. The function of NN is to predict the field current that realizes the field weakening to drive the motor over rated speed. The parameters of NN are optimized by the Social Spider Optimization (SSO) algorithm. The system has been implemented using MATLAB/SIMULINK software. The simulation results show that the proposed method gives a good performance and is feasible to be applied instead of others conventional combined control methods.展开更多
In this current century,most industries are moving towards automation,where human intervention is dramatically reduced.This revolution leads to industrial revolution 4.0,which uses the Internet of Things(IoT)and wirel...In this current century,most industries are moving towards automation,where human intervention is dramatically reduced.This revolution leads to industrial revolution 4.0,which uses the Internet of Things(IoT)and wireless sensor networks(WSN).With its associated applications,this IoT device is used to compute the receivedWSN data from devices and transfer it to remote locations for assistance.In general,WSNs,the gateways are a long distance from the base station(BS)and are communicated through the gateways nearer to the BS.At the gateway,which is closer to the BS,energy drains faster because of the heavy load,which leads to energy issues around the BS.Since the sensors are battery-operated,either replacement or recharging of those sensor node batteries is not possible after it is deployed to their corresponding areas.In that situation,energy plays a vital role in sensor survival.Concerning reducing the network energy consumption and increasing the network lifetime,this paper proposed an efficient cluster head selection using Improved Social spider Optimization with a Rough Set(ISSRS)and routing path selection to reduce the network load using the Improved Grey wolf optimization(IGWO)approach.(i)Using ISSRS,the initial clusters are formed with the local nodes,and the cluster head is chosen.(ii)Load balancing through routing path selection using IGWO.The simulation results prove that the proposed optimization-based approaches efficiently reduce the energy through load balancing compared to existing systems in terms of energy efficiency,packet delivery ratio,network throughput,and packet loss percentage.展开更多
Spider monkey optimization(SMO)is a quite popular and recent swarm intelligence algorithm for numerical optimization.SMO is Fission-Fusion social structure based algorithm inspired by spider monkey’s behavior.The alg...Spider monkey optimization(SMO)is a quite popular and recent swarm intelligence algorithm for numerical optimization.SMO is Fission-Fusion social structure based algorithm inspired by spider monkey’s behavior.The algorithm proves to be very efficient in solving various constrained and unconstrained optimization problems.This paper presents the application of SMO in fog computing.We propose a heuristic initialization based spider monkey optimization algorithm for resource allocation and scheduling in a fog computing network.The algorithm minimizes the total cost(service time and monetary cost)of tasks by choosing the optimal fog nodes.Longest job fastest processor(LJFP),shortest job fastest processor(SJFP),and minimum completion time(MCT)based initialization of SMO are proposed and compared with each other.The performance is compared based on the parameters of average cost,average service time,average monetary cost,and the average cost per schedule.The results demonstrate the efficacy of MCT-SMO as compared to other heuristic initialization based SMO algorithms and Particle Swarm Optimization(PSO).展开更多
In present scenario of wireless communications,Long Term Evolution(LTE)based network technology is evolved and provides consistent data delivery with high speed andminimal delay through mobile devices.The traffic mana...In present scenario of wireless communications,Long Term Evolution(LTE)based network technology is evolved and provides consistent data delivery with high speed andminimal delay through mobile devices.The traffic management and effective utilization of network resources are the key factors of LTE models.Moreover,there are some major issues in LTE that are to be considered are effective load scheduling and traffic management.Through LTE is a depraved technology,it is been suffering from these issues.On addressing that,this paper develops an Elite Opposition based Spider Monkey Optimization Framework for Efficient Load Balancing(SMO-ELB).In this model,load computation of each mobile node is done with Bounding Theory based Load derivations and optimal cell selection for seamless communication is processed with Spider Monkey Optimization Algorithm.The simulation results show that the proposed model provides better results than exiting works in terms of efficiency,packet delivery ratio,Call Dropping Ratio(CDR)and Call Blocking Ratio(CBR).展开更多
Traditional Wireless Sensor Networks(WSNs)comprise of costeffective sensors that can send physical parameters of the target environment to an intended user.With the evolution of technology,multimedia sensor nodes have...Traditional Wireless Sensor Networks(WSNs)comprise of costeffective sensors that can send physical parameters of the target environment to an intended user.With the evolution of technology,multimedia sensor nodes have become the hot research topic since it can continue gathering multimedia content and scalar from the target domain.The existence of multimedia sensors,integrated with effective signal processing and multimedia source coding approaches,has led to the increased application of Wireless Multimedia Sensor Network(WMSN).This sort of network has the potential to capture,transmit,and receive multimedia content.Since energy is a major source in WMSN,novel clustering approaches are essential to deal with adaptive topologies of WMSN and prolonged network lifetime.With this motivation,the current study develops an Enhanced Spider Monkey Optimization-based Energy-Aware Clustering Scheme(ESMO-EACS)for WMSN.The proposed ESMO-EACS model derives ESMO algorithm by incorporating the concepts of SMO algorithm and quantum computing.The proposed ESMO-EACS model involves the design of fitness functions using distinct input parameters for effective construction of clusters.A comprehensive experimental analysis was conducted to validate the effectiveness of the proposed ESMO-EACS technique in terms of different performance measures.The simulation outcome established the superiority of the proposed ESMO-EACS technique to other methods under various measures.展开更多
基金funded by the National Natural Science Foundation of China under Grant No.61602162.
文摘The massive influx of traffic on the Internet has made the composition of web traffic increasingly complex.Traditional port-based or protocol-based network traffic identification methods are no longer suitable for today’s complex and changing networks.Recently,machine learning has beenwidely applied to network traffic recognition.Still,high-dimensional features and redundant data in network traffic can lead to slow convergence problems and low identification accuracy of network traffic recognition algorithms.Taking advantage of the faster optimizationseeking capability of the jumping spider optimization algorithm(JSOA),this paper proposes a jumping spider optimization algorithmthat incorporates the harris hawk optimization(HHO)and small hole imaging(HHJSOA).We use it in network traffic identification feature selection.First,the method incorporates the HHO escape energy factor and the hard siege strategy to forma newsearch strategy for HHJSOA.This location update strategy enhances the search range of the optimal solution of HHJSOA.We use small hole imaging to update the inferior individual.Next,the feature selection problem is coded to propose a jumping spiders individual coding scheme.Multiple iterations of the HHJSOA algorithmfind the optimal individual used as the selected feature for KNN classification.Finally,we validate the classification accuracy and performance of the HHJSOA algorithm using the UNSW-NB15 dataset and KDD99 dataset.Experimental results show that compared with other algorithms for the UNSW-NB15 dataset,the improvement is at least 0.0705,0.00147,and 1 on the accuracy,fitness value,and the number of features.In addition,compared with other feature selectionmethods for the same datasets,the proposed algorithmhas faster convergence,better merit-seeking,and robustness.Therefore,HHJSOAcan improve the classification accuracy and solve the problem that the network traffic recognition algorithm needs to be faster to converge and easily fall into local optimum due to high-dimensional features.
基金supported by the First Batch of Teaching Reform Projects of Zhejiang Higher Education“14th Five-Year Plan”(jg20220434)Special Scientific Research Project for Space Debris and Near-Earth Asteroid Defense(KJSP2020020202)+1 种基金Natural Science Foundation of Zhejiang Province(LGG19F030010)National Natural Science Foundation of China(61703183).
文摘As a new bionic algorithm,Spider Monkey Optimization(SMO)has been widely used in various complex optimization problems in recent years.However,the new space exploration power of SMO is limited and the diversity of the population in SMO is not abundant.Thus,this paper focuses on how to reconstruct SMO to improve its performance,and a novel spider monkey optimization algorithm with opposition-based learning and orthogonal experimental design(SMO^(3))is developed.A position updatingmethod based on the historical optimal domain and particle swarmfor Local Leader Phase(LLP)andGlobal Leader Phase(GLP)is presented to improve the diversity of the population of SMO.Moreover,an opposition-based learning strategy based on self-extremum is proposed to avoid suffering from premature convergence and getting stuck at locally optimal values.Also,a local worst individual elimination method based on orthogonal experimental design is used for helping the SMO algorithm eliminate the poor individuals in time.Furthermore,an extended SMO^(3)named CSMO^(3)is investigated to deal with constrained optimization problems.The proposed algorithm is applied to both unconstrained and constrained functions which include the CEC2006 benchmark set and three engineering problems.Experimental results show that the performance of the proposed algorithm is better than three well-known SMO algorithms and other evolutionary algorithms in unconstrained and constrained problems.
文摘To solve the problem of slow convergence and easy to get into the local optimum of the spider monkey optimization algorithm,this paper presents a new algorithm based on multi-strategy(ISMO).First,the initial population is generated by a refracted opposition-based learning strategy to enhance diversity and ergodicity.Second,this paper introduces a non-linear adaptive dynamic weight factor to improve convergence efficiency.Then,using the crisscross strategy,using the horizontal crossover to enhance the global search and vertical crossover to keep the diversity of the population to avoid being trapped in the local optimum.At last,we adopt a Gauss-Cauchy mutation strategy to improve the stability of the algorithm by mutation of the optimal individuals.Therefore,the application of ISMO is validated by ten benchmark functions and feature selection.It is proved that the proposed method can resolve the problem of feature selection.
文摘Due to the drastic increase in global population as well as economy,electricity demand becomes considerably high.The recently developed smart grid(SG)technology has the ability to minimize power loss at the time of power distribution.Machine learning(ML)and deep learning(DL)models can be effectually developed for the design of SG stability techniques.This article introduces a new Social Spider Optimization with Deep Learning Enabled Statistical Analysis for Smart Grid Stability(SSODLSA-SGS)pre-diction model.Primarily,class imbalance data handling process is performed using Synthetic minority oversampling technique(SMOTE)technique.The SSODLSA-SGS model involves two stages of pre-processing namely data nor-malization and transformation.Besides,the SSODLSA-SGS model derives a deep belief-back propagation neural network(DBN-BN)model for the pre-diction of SG stability.Finally,social spider optimization(SSO)algorithm can be applied for determining the optimal hyperparameter values of the DBN-BN model.The design of SSO algorithm helps to appropriately modify the hyperparameter values of the DBN-BN model.A series of simulation analyses are carried out to highlight the enhanced outcomes of the SSODLSA-SGS model.The extensive comparative study reported the enhanced performance of the SSODLSA-SGS algorithm over the other recent techniques interms of several measures.
文摘This paper presents the speed control of a separately excited DC motor using Neural Network (NN) controller in field weakening region. In armature control, speed controller has been used in outer loop while current controller in inner loop is used. The function of NN is to predict the field current that realizes the field weakening to drive the motor over rated speed. The parameters of NN are optimized by the Social Spider Optimization (SSO) algorithm. The system has been implemented using MATLAB/SIMULINK software. The simulation results show that the proposed method gives a good performance and is feasible to be applied instead of others conventional combined control methods.
基金This work was supported by the Collabo R&D between Industry,Academy,and Research Institute(S3250534)funded by the Ministry of SMEs and Startups(MSS,Korea)the Soonchunhyang University Research Fund。
文摘In this current century,most industries are moving towards automation,where human intervention is dramatically reduced.This revolution leads to industrial revolution 4.0,which uses the Internet of Things(IoT)and wireless sensor networks(WSN).With its associated applications,this IoT device is used to compute the receivedWSN data from devices and transfer it to remote locations for assistance.In general,WSNs,the gateways are a long distance from the base station(BS)and are communicated through the gateways nearer to the BS.At the gateway,which is closer to the BS,energy drains faster because of the heavy load,which leads to energy issues around the BS.Since the sensors are battery-operated,either replacement or recharging of those sensor node batteries is not possible after it is deployed to their corresponding areas.In that situation,energy plays a vital role in sensor survival.Concerning reducing the network energy consumption and increasing the network lifetime,this paper proposed an efficient cluster head selection using Improved Social spider Optimization with a Rough Set(ISSRS)and routing path selection to reduce the network load using the Improved Grey wolf optimization(IGWO)approach.(i)Using ISSRS,the initial clusters are formed with the local nodes,and the cluster head is chosen.(ii)Load balancing through routing path selection using IGWO.The simulation results prove that the proposed optimization-based approaches efficiently reduce the energy through load balancing compared to existing systems in terms of energy efficiency,packet delivery ratio,network throughput,and packet loss percentage.
文摘Spider monkey optimization(SMO)is a quite popular and recent swarm intelligence algorithm for numerical optimization.SMO is Fission-Fusion social structure based algorithm inspired by spider monkey’s behavior.The algorithm proves to be very efficient in solving various constrained and unconstrained optimization problems.This paper presents the application of SMO in fog computing.We propose a heuristic initialization based spider monkey optimization algorithm for resource allocation and scheduling in a fog computing network.The algorithm minimizes the total cost(service time and monetary cost)of tasks by choosing the optimal fog nodes.Longest job fastest processor(LJFP),shortest job fastest processor(SJFP),and minimum completion time(MCT)based initialization of SMO are proposed and compared with each other.The performance is compared based on the parameters of average cost,average service time,average monetary cost,and the average cost per schedule.The results demonstrate the efficacy of MCT-SMO as compared to other heuristic initialization based SMO algorithms and Particle Swarm Optimization(PSO).
文摘In present scenario of wireless communications,Long Term Evolution(LTE)based network technology is evolved and provides consistent data delivery with high speed andminimal delay through mobile devices.The traffic management and effective utilization of network resources are the key factors of LTE models.Moreover,there are some major issues in LTE that are to be considered are effective load scheduling and traffic management.Through LTE is a depraved technology,it is been suffering from these issues.On addressing that,this paper develops an Elite Opposition based Spider Monkey Optimization Framework for Efficient Load Balancing(SMO-ELB).In this model,load computation of each mobile node is done with Bounding Theory based Load derivations and optimal cell selection for seamless communication is processed with Spider Monkey Optimization Algorithm.The simulation results show that the proposed model provides better results than exiting works in terms of efficiency,packet delivery ratio,Call Dropping Ratio(CDR)and Call Blocking Ratio(CBR).
文摘Traditional Wireless Sensor Networks(WSNs)comprise of costeffective sensors that can send physical parameters of the target environment to an intended user.With the evolution of technology,multimedia sensor nodes have become the hot research topic since it can continue gathering multimedia content and scalar from the target domain.The existence of multimedia sensors,integrated with effective signal processing and multimedia source coding approaches,has led to the increased application of Wireless Multimedia Sensor Network(WMSN).This sort of network has the potential to capture,transmit,and receive multimedia content.Since energy is a major source in WMSN,novel clustering approaches are essential to deal with adaptive topologies of WMSN and prolonged network lifetime.With this motivation,the current study develops an Enhanced Spider Monkey Optimization-based Energy-Aware Clustering Scheme(ESMO-EACS)for WMSN.The proposed ESMO-EACS model derives ESMO algorithm by incorporating the concepts of SMO algorithm and quantum computing.The proposed ESMO-EACS model involves the design of fitness functions using distinct input parameters for effective construction of clusters.A comprehensive experimental analysis was conducted to validate the effectiveness of the proposed ESMO-EACS technique in terms of different performance measures.The simulation outcome established the superiority of the proposed ESMO-EACS technique to other methods under various measures.
