RESUMO
Mobile sensors can extend the range of monitoring and overcome static sensors' limitations and are increasingly used in real-life applications. Since there can be significant errors in mobile sensor localization using the Monte Carlo Localization (MCL), this paper improves the food digestion algorithm (FDA). This paper applies the improved algorithm to the mobile sensor localization problem to reduce localization errors and improve localization accuracy. Firstly, this paper proposes three inter-group communication strategies to speed up the convergence of the algorithm based on the topology that exists between groups. Finally, the improved algorithm is applied to the mobile sensor localization problem, reducing the localization error and achieving good localization results.
RESUMO
The visual cryptography scheme (VCS) distributes a secret to several images that can enhance the secure transmission of that secret. Quick response (QR) codes are widespread. VCS can be used to improve their secure transmission. Some schemes recover QR codes with many errors. This paper uses a distribution mechanism to achieve the error-free recovery of QR codes. An error-correction codeword (ECC) is used to divide the QR code into different areas. Every area is a key, and they are distributed to n shares. The loss of any share will make the reconstructed QR code impossible to decode normally. Stacking all shares can recover the secret QR code losslessly. Based on some experiments, the proposed scheme is relatively safe. The proposed scheme can restore a secret QR code without errors, and it is effective and feasible.
RESUMO
The heuristic optimization algorithm is a popular optimization method for solving optimization problems. A novel meta-heuristic algorithm was proposed in this paper, which is called the Willow Catkin Optimization (WCO) algorithm. It mainly consists of two processes: spreading seeds and aggregating seeds. In the first process, WCO tries to make the seeds explore the solution space to find the local optimal solutions. In the second process, it works to develop each optimal local solution and find the optimal global solution. In the experimental section, the performance of WCO is tested with 30 test functions from CEC 2017. WCO was applied in the Time Difference of Arrival and Frequency Difference of Arrival (TDOA-FDOA) co-localization problem of moving nodes in Wireless Sensor Networks (WSNs). Experimental results show the performance and applicability of the WCO algorithm.
RESUMO
Inspired by the bamboo growth process, Chu et al. proposed the Bamboo Forest Growth Optimization (BFGO) algorithm. It incorporates bamboo whip extension and bamboo shoot growth into the optimization process. It can be applied very well to classical engineering problems. However, binary values can only take 0 or 1, and for some binary optimization problems, the standard BFGO is not applicable. This paper firstly proposes a binary version of BFGO, called BBFGO. By analyzing the search space of BFGO under binary conditions, the new curve V-shaped and Taper-shaped transfer function for converting continuous values into binary BFGO is proposed for the first time. A long-mutation strategy with a new mutation approach is presented to solve the algorithmic stagnation problem. Binary BFGO and the long-mutation strategy with a new mutation are tested on 23 benchmark test functions. The experimental results show that binary BFGO achieves better results in solving the optimal values and convergence speed, and the variation strategy can significantly enhance the algorithm's performance. In terms of application, 12 data sets derived from the UCI machine learning repository are selected for feature-selection implementation and compared with the transfer functions used by BGWO-a, BPSO-TVMS and BQUATRE, which demonstrates binary BFGO algorithm's potential to explore the attribute space and choose the most significant features for classification issues.
RESUMO
Meta-heuristic algorithms are widely used in complex problems that cannot be solved by traditional computing methods due to their powerful optimization capabilities. However, for high-complexity problems, the fitness function evaluation may take hours or even days to complete. The surrogate-assisted meta-heuristic algorithm effectively solves this kind of long solution time for the fitness function. Therefore, this paper proposes an efficient surrogate-assisted hybrid meta-heuristic algorithm by combining the surrogate-assisted model with gannet optimization algorithm (GOA) and the differential evolution (DE) algorithm, abbreviated as SAGD. We explicitly propose a new add-point strategy based on information from historical surrogate models, using information from historical surrogate models to allow the selection of better candidates for the evaluation of true fitness values and the local radial basis function (RBF) surrogate to model the landscape of the objective function. The control strategy selects two efficient meta-heuristic algorithms to predict the training model samples and perform updates. A generation-based optimal restart strategy is also incorporated in SAGD to select suitable samples to restart the meta-heuristic algorithm. We tested the SAGD algorithm using seven commonly used benchmark functions and the wireless sensor network (WSN) coverage problem. The results show that the SAGD algorithm performs well in solving expensive optimization problems.
RESUMO
The bamboo forest growth optimization (BFGO) algorithm combines the characteristics of the bamboo forest growth process with the optimization course of the algorithm. The algorithm performs well in dealing with optimization problems, but its exploitation ability is not outstanding. Therefore, a new heuristic algorithm named orthogonal learning quasi-affine transformation evolutionary bamboo forest growth optimization (OQBFGO) algorithm is proposed in this work. This algorithm combines the quasi-affine transformation evolution algorithm to expand the particle distribution range, a process of entropy increase that can significantly improve particle searchability. The algorithm also uses an orthogonal learning strategy to accurately aggregate particles from a chaotic state, which can be an entropy reduction process that can more accurately perform global development. OQBFGO algorithm, BFGO algorithm, quasi-affine transformation evolutionary bamboo growth optimization (QBFGO) algorithm, orthogonal learning bamboo growth optimization (OBFGO) algorithm, and three other mature algorithms are tested on the CEC2017 benchmark function. The experimental results show that the OQBFGO algorithm is superior to the above algorithms. Then, OQBFGO is used to solve the capacitated vehicle routing problem. The results show that OQBFGO can obtain better results than other algorithms.
RESUMO
The localization problem of nodes in wireless sensor networks is often the focus of many researches. This paper proposes an opposition-based learning and parallel strategies Artificial Gorilla Troop Optimizer (OPGTO) for reducing the localization error. Opposition-based learning can expand the exploration space of the algorithm and significantly improve the global exploration ability of the algorithm. The parallel strategy divides the population into multiple groups for exploration, which effectively increases the diversity of the population. Based on this parallel strategy, we design communication strategies between groups for different types of optimization problems. To verify the optimized effect of the proposed OPGTO algorithm, it is tested on the CEC2013 benchmark function set and compared with Particle Swarm Optimization (PSO), Sine Cosine Algorithm (SCA), Whale Optimization Algorithm (WOA) and Artificial Gorilla Troops Optimizer (GTO). Experimental studies show that OPGTO has good optimization ability, especially on complex multimodal functions and combinatorial functions. Finally, we apply OPGTO algorithm to 3D localization of wireless sensor networks in the real terrain. Experimental results proved that OPGTO can effectively reduce the localization error based on Time Difference of Arrival (TDOA).
Assuntos
Algoritmos , Tecnologia sem Fio , ComunicaçãoRESUMO
In wireless sensor networks (WSN), most sensor nodes are powered by batteries with limited power, meaning the quality of the network may deteriorate at any time. Therefore, to reduce the energy consumption of sensor nodes and extend the lifetime of the network, this study proposes a novel energy-efficient clustering mechanism of a routing protocol. First, a novel metaheuristic algorithm is proposed, based on differential equations of bamboo growth and the Gaussian mixture model, called the bamboo growth optimizer (BFGO). Second, based on the BFGO algorithm, a clustering mechanism of a routing protocol (BFGO-C) is proposed, in which the encoding method and fitness function are redesigned. It can maximize the energy efficiency and minimize the transmission distance. In addition, heterogeneous nodes are added to the WSN to distinguish tasks among nodes and extend the lifetime of the network. Finally, this paper compares the proposed BFGO-C with three classic clustering protocols. The results show that the protocol based on the BFGO-C can be successfully applied to the clustering routing protocol and can effectively reduce energy consumption and enhance network performance.
RESUMO
Metaheuristic algorithms are widely employed in modern engineering applications because they do not need to have the ability to study the objective function's features. However, these algorithms may spend minutes to hours or even days to acquire one solution. This paper presents a novel efficient Mahalanobis sampling surrogate model assisting Ant Lion optimization algorithm to address this problem. For expensive calculation problems, the optimization effect goes even further by using MSAALO. This model includes three surrogate models: the global model, Mahalanobis sampling surrogate model, and local surrogate model. Mahalanobis distance can also exclude the interference correlations of variables. In the Mahalanobis distance sampling model, the distance between each ant and the others could be calculated. Additionally, the algorithm sorts the average length of all ants. Then, the algorithm selects some samples to train the model from these Mahalanobis distance samples. Seven benchmark functions with various characteristics are chosen to testify to the effectiveness of this algorithm. The validation results of seven benchmark functions demonstrate that the algorithm is more competitive than other algorithms. The simulation results based on different radii and nodes show that MSAALO improves the average coverage by 2.122% and 1.718%, respectively.
RESUMO
Node coverage is one of the crucial metrics for wireless sensor networks' (WSNs') quality of service, directly affecting the target monitoring area's monitoring capacity. Pursuit of the optimal node coverage encounters increasing difficulties because of the limited computational power of individual nodes, the scale of the network, and the operating environment's complexity and constant change. This paper proposes a solution to the optimal node coverage of unbalanced WSN distribution during random deployment based on an enhanced Archimedes optimization algorithm (EAOA). The best findings for network coverage from several sub-areas are combined using the EAOA. In order to address the shortcomings of the original Archimedes optimization algorithm (AOA) in handling complicated scenarios, we suggest an EAOA based on the AOA by adapting its equations with reverse learning and multidirection techniques. The obtained results from testing the benchmark function and the optimal WSN node coverage of the EAOA are compared with the other algorithms in the literature. The results show that the EAOA algorithm performs effectively, increasing the feasible range and convergence speed.
RESUMO
The migration and predation of grasshoppers inspire the grasshopper optimization algorithm (GOA). It can be applied to practical problems. The binary grasshopper optimization algorithm (BGOA) is used for binary problems. To improve the algorithm's exploration capability and the solution's quality, this paper modifies the step size in BGOA. The step size is expanded and three new transfer functions are proposed based on the improvement. To demonstrate the availability of the algorithm, a comparative experiment with BGOA, particle swarm optimization (PSO), and binary gray wolf optimizer (BGWO) is conducted. The improved algorithm is tested on 23 benchmark test functions. Wilcoxon rank-sum and Friedman tests are used to verify the algorithm's validity. The results indicate that the optimized algorithm is significantly more excellent than others in most functions. In the aspect of the application, this paper selects 23 datasets of UCI for feature selection implementation. The improved algorithm yields higher accuracy and fewer features.
RESUMO
Manually designing a convolutional neural network (CNN) is an important deep learning method for solving the problem of image classification. However, most of the existing CNN structure designs consume a significant amount of time and computing resources. Over the years, the demand for neural architecture search (NAS) methods has been on the rise. Therefore, we propose a novel deep architecture generation model based on Aquila optimization (AO) and a genetic algorithm (GA). The main contributions of this paper are as follows: Firstly, a new encoding strategy representing the CNN coding structure is proposed, so that the evolutionary computing algorithm can be combined with CNN. Secondly, a new mechanism for updating location is proposed, which incorporates three typical operators from GA cleverly into the model we have designed so that the model can find the optimal solution in the limited search space. Thirdly, the proposed method can deal with the variable-length CNN structure by adding skip connections. Fourthly, combining traditional CNN layers and residual blocks and introducing a grouping strategy provides greater possibilities for searching for the optimal CNN structure. Additionally, we use two notable datasets, consisting of the MNIST and CIFAR-10 datasets for model evaluation. The experimental results show that our proposed model has good results in terms of search accuracy and time.
RESUMO
In this study, an automatic pennation angle measuring approach based on deep learning is proposed. Firstly, the Local Radon Transform (LRT) is used to detect the superficial and deep aponeuroses on the ultrasound image. Secondly, a reference line are introduced between the deep and superficial aponeuroses to assist the detection of the orientation of muscle fibers. The Deep Residual Networks (Resnets) are used to judge the relative orientation of the reference line and muscle fibers. Then, reference line is revised until the line is parallel to the orientation of the muscle fibers. Finally, the pennation angle is obtained according to the direction of the detected aponeuroses and the muscle fibers. The angle detected by our proposed method differs by about 1° from the angle manually labeled. With a CPU, the average inference time for a single image of the muscle fibers with the proposed method is around 1.6 s, compared to 0.47 s for one of the image of a sequential image sequence. Experimental results show that the proposed method can achieve accurate and robust measurements of pennation angle.
Assuntos
UltrassonografiaRESUMO
In this paper, a new intelligent computing algorithm named Enhanced Black Hole (EBH) is proposed to which the mutation operation and weight factor are applied. In EBH, several elites are taken as role models instead of only one in the original Black Hole (BH) algorithm. The performance of the EBH algorithm is verified by the CEC 2013 test suit, and shows better results than the original BH. In addition, the EBH and other celebrated algorithms can be used to solve node coverage problems of Wireless Sensor Network (WSN) in 3-D terrain with satisfactory performance.
RESUMO
Transmission power optimization is the most significant factor in prolonging the lifetime and maintaining the connection quality of wireless sensor networks. Un-optimized transmission power of nodes either interferes with or fails to link neighboring nodes. The optimization of transmission power depends on the expected node degree and node distribution. In this study, an optimization approach to an energy-efficient and full reachability wireless sensor network is proposed. In the proposed approach, an adjustment model of the transmission range with a minimum node degree is proposed that focuses on topology control and optimization of the transmission range according to node degree and node density. The model adjusts the tradeoff between energy efficiency and full reachability to obtain an ideal transmission range. In addition, connectivity and reachability are used as performance indices to evaluate the connection quality of a network. The two indices are compared to demonstrate the practicability of framework through simulation results. Furthermore, the relationship between the indices under the conditions of various node degrees is analyzed to generalize the characteristics of node densities. The research results on the reliability and feasibility of the proposed approach will benefit the future real deployments.
Assuntos
Redes de Comunicação de Computadores , Poder Psicológico , Tecnologia sem Fio , Algoritmos , Simulação por Computador , Humanos , Modelos TeóricosRESUMO
This article presents a comprehensively state-of-the-art investigation of the engineering applications utilized by binary metaheuristic algorithms. Surveyed work is categorized based on application scenarios and solution encoding, and describes these algorithms in detail to help researchers choose appropriate methods to solve related applications. It is seen that transfer function is the main binary coding of metaheuristic algorithms, which usually adopts Sigmoid function. Among the contributions presented, there were different implementations and applications of metaheuristic algorithms, or the study of engineering applications by different objective functions such as the single- and multi-objective problems of feature selection, scheduling, layout and engineering structure optimization. The article identifies current troubles and challenges by the conducted review, and discusses that novel binary algorithm, transfer function, benchmark function, time-consuming problem and application integration are need to be resolved in future.
RESUMO
Aiming at the problem of fault detection in data collection in wireless sensor networks, this paper combines evolutionary computing and machine learning to propose a productive technical solution. We choose the classical particle swarm optimization (PSO) and improve it, including the introduction of a biological population model to control the population size, and the addition of a parallel mechanism for further tuning. The proposed RS-PPSO algorithm was successfully used to optimize the initial weights and biases of back propagation neural network (BPNN), shortening the training time and raising the prediction accuracy. Wireless sensor networks (WSN) has become the key supporting platform of Internet of Things (IoT). The correctness of the data collected by the sensor nodes has a great influence on the reliability, real-time performance and energy saving of the entire network. The optimized machine learning technology scheme given in this paper can effectively identify the fault data, so as to ensure the effective operation of WSN.
RESUMO
The traditional parameter estimation methods for photovoltaic (PV) module are strictly limited by the reference standards. On the basis of the double diode model (DDM), this paper proposes a modified PV module that is independent of the reference conditions and can be used for the transformation and reconfiguration of PV module. With respect to the issue of the slow convergence precision and the tendency to trap in the local extremum of the QUATRE algorithm, this research incorporates the QUATRE algorithm with recombination mechanism (RQUATRE) to tackle the problem of parameter estimation for the improved PV modules described above. Simulation data show that the RQUATRE wins 29, 29, 21, 17 and 15 times with the FMO, PIO, QUATRE, PSO and GWO algorithms on the CEC2017 test suite. In addition, in a modified PV module for the parameter extraction problem, the final experimental results achieved a value of 2.99 × 10-3 at RMSE, all better than the accuracy values of the compared algorithms. In the fitting process of IAE, the final values are also all less than 10%, which can satisfy the fitting needs.
RESUMO
Firefly algorithm (FA) is a meta-heuristic optimization algorithm inspired by nature. Due to its superior performance, it has been widely used in real life. However, it also has some shortcomings in some optimization cases, such as low solution accuracy and slow solution speed. Therefore, in this paper, distributed parallel firefly algorithm (DPFA) with four communication strategies is presented to improve these shortcomings. The distributed parallel technique is implanted to divide the initial fireflies into several subgroups, and exchange the information based on communication strategies among subgroups after the fixed iteration. The communication strategies include the maximum of the same group, the average of the same group, the maximum of different groups and the average of different groups. For verifying its performance, this paper compared DPFA with famous optimization algorithms, and experimental results show that DPFA has stronger competitiveness under the test suite of CEC2013. Furthermore, the proposed DPFA is also applied to the PID parameter tuning of variable pitch wind turbine, and conducted experiments show that DPFA outperforms other algorithms. It can smooth the power output and reduce the impact on the power grid when the wind speed fluctuates.