A novel gateway node reconfiguration method of IOT based on hierarchical coding particle swarm optimization

2021 ◽  
pp. 1-14
Author(s):  
Wei Shu ◽  
Dajiang He ◽  
Jun Shu

In order to overcome the problems of low channel utilization, low transmission success rate and high data transmission delay in current gateway node reconfiguration methods of IOT, this paper proposes a novel gateway node reconfiguration method of IOT based on hierarchical coding particle swarm optimization. Based on the IOT network model, this paper analyzes the delay characteristics of the IOT, and constructs the object function of the gateway node reconfiguration of IOT. By monotone decreasing inertia weight strategy, the coding particle swarm optimization is optimized, and the reconfiguration objective function of the gateway node of IOT by using the optimized particle swarm optimization algorithm is solved. Experimental results show that the channel utilization ratio of the proposed method is higher than 90%, the success rate of information transmission is more than 80%, and the data transmission delay is less than 0.5 s, which indicates that the proposed method has high channel utilization, high transmission success rate and low data transmission delay.

Sensors ◽  
2020 ◽  
Vol 20 (24) ◽  
pp. 7158
Author(s):  
Naufal Suryanto ◽  
Hyoeun Kang ◽  
Yongsu Kim ◽  
Youngyeo Yun ◽  
Harashta Tatimma Larasati ◽  
...  

Adversarial attack techniques in deep learning have been studied extensively due to its stealthiness to human eyes and potentially dangerous consequences when applied to real-life applications. However, current attack methods in black-box settings mainly employ a large number of queries for crafting their adversarial examples, hence making them very likely to be detected and responded by the target system (e.g., artificial intelligence (AI) service provider) due to its high traffic volume. A recent proposal able to address the large query problem utilizes a gradient-free approach based on Particle Swarm Optimization (PSO) algorithm. Unfortunately, this original approach tends to have a low attack success rate, possibly due to the model’s difficulty of escaping local optima. This obstacle can be overcome by employing a multi-group approach for PSO algorithm, by which the PSO particles can be redistributed, preventing them from being trapped in local optima. In this paper, we present a black-box adversarial attack which can significantly increase the success rate of PSO-based attack while maintaining a low number of query by launching the attack in a distributed manner. Attacks are executed from multiple nodes, disseminating queries among the nodes, hence reducing the possibility of being recognized by the target system while also increasing scalability. Furthermore, we utilize Multi-Group PSO with Random Redistribution (MGRR-PSO) for perturbation generation, performing better than the original approach against local optima, thus achieving a higher success rate. Additionally, we propose to efficiently remove excessive perturbation (i.e, perturbation pruning) by utilizing again the MGRR-PSO rather than a standard iterative method as used in the original approach. We perform five different experiments: comparing our attack’s performance with existing algorithms, testing in high-dimensional space in ImageNet dataset, examining our hyperparameters (i.e., particle size, number of clients, search boundary), and testing on real digital attack to Google Cloud Vision. Our attack proves to obtain a 100% success rate on MNIST and CIFAR-10 datasets and able to successfully fool Google Cloud Vision as a proof of the real digital attack by maintaining a lower query and wide applicability.


Mathematics ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1745
Author(s):  
Xu Zhang ◽  
Pan Guo ◽  
Hua Zhang ◽  
Jin Yao

Process planning is a typical combinatorial optimization problem. When the scale of the problem increases, combinatorial explosion occurs, which makes it difficult for traditional precise algorithms to solve the problem. A hybrid particle swarm optimization (HPSO) algorithm is proposed in this paper to solve problems of process planning. A hierarchical coding method including operation layer, machine layer and logic layer is designed in this algorithm. Each layer of coding corresponds to the decision of a sub-problem of process planning. Several genetic operators of the genetic algorithm are designed to replace the update formula of particle position and velocity in the particle swarm optimization algorithm. The results of the benchmark example in case study show that the algorithm proposed in this paper has better performance.


2020 ◽  
pp. 1-14
Author(s):  
Bahman Arasteh ◽  
Razieh Sadegi ◽  
Keyvan Arasteh

A considerable percentage of software costs are usually related to its maintenance. Program comprehension is a prerequisite of the software maintenance and a considerable time of maintainers is spent to comprehend the structure and behavior of the software when the source code is the only product available. Program comprehension is one of difficult and challenging task especially in the absence of design documents of the software system. Clustering of software modules is an effective reverse-engineering method for extracting the software architecture and structural model from the source code. Finding the best clustering is considered to be a multi-objective NP hard optimization-problem and different meta-heuristic algorithms have been used for solving this problem. Local optimum, insufficient quality, insufficient performance and insufficient stability are the main shortcomings of the previous methods. Attaining higher values for software clustering quality, attaining higher success rate in clustering of software modules, attaining higher stability of the obtained results and attaining the higher convergence (speed) to generate optimal clusters are the main goals of this study. In this study, a hybrid meta heuristic method (ARAZ)1 includes particle swarm optimization algorithm and genetic algorithm (PSO-GA) is proposed to find the best clustering of software modules. An extensive series of experiments on 10 standard benchmark programs have been conducted. Regarding the results of experiments, the proposed method outperforms the other methods in terms of clustering quality, stability, success rate and convergence speed.


2020 ◽  
Vol 39 (4) ◽  
pp. 5699-5711
Author(s):  
Shirong Long ◽  
Xuekong Zhao

The smart teaching mode overcomes the shortcomings of traditional teaching online and offline, but there are certain deficiencies in the real-time feature extraction of teachers and students. In view of this, this study uses the particle swarm image recognition and deep learning technology to process the intelligent classroom video teaching image and extracts the classroom task features in real time and sends them to the teacher. In order to overcome the shortcomings of the premature convergence of the standard particle swarm optimization algorithm, an improved strategy for multiple particle swarm optimization algorithms is proposed. In order to improve the premature problem in the search performance algorithm of PSO algorithm, this paper combines the algorithm with the useful attributes of other algorithms to improve the particle diversity in the algorithm, enhance the global search ability of the particle, and achieve effective feature extraction. The research indicates that the method proposed in this paper has certain practical effects and can provide theoretical reference for subsequent related research.


Author(s):  
Fachrudin Hunaini ◽  
Imam Robandi ◽  
Nyoman Sutantra

Fuzzy Logic Control (FLC) is a reliable control system for controlling nonlinear systems, but to obtain optimal fuzzy logic control results, optimal Membership Function parameters are needed. Therefore in this paper Particle Swarm Optimization (PSO) is used as a fast and accurate optimization method to determine Membership Function parameters. The optimal control system simulation is carried out on the automatic steering system of the vehicle model and the results obtained are the vehicle's lateral motion error can be minimized so that the movement of the vehicle can always be maintained on the expected trajectory


Sign in / Sign up

Export Citation Format

Share Document