scholarly journals An Improved Intrusion Weed Optimization Algorithm for Node Location in Wireless Sensor Networks

2022 ◽  
Vol 16 ◽  
pp. 525-530
Author(s):  
Shihui Li
Keyword(s):  
Optimization Algorithm ◽  
Initial Position ◽  
Coverage Rate ◽  
Network Coverage ◽  
Invasive Weed ◽  
Solution Quality ◽  
Optimal Network ◽  
Chaotic Operator ◽  
Node Location ◽  
Update Strategy

The distribution optimization of WSN nodes is one of the key issues in WSN research, and also is a research hotspot in the field of communication. Aiming at the distribution optimization of WSN nodes, the distribution optimization scheme of nodes based on improved invasive weed optimization algorithm(IIWO) is proposed. IIWO improves the update strategy of the initial position of weeds by using cubic mapping chaotic operator, and uses the Gauss mutation operator to increase the diversity of the population. The simulation results show that the algorithm proposed in this paper has a higher solution quality and faster convergence speed than IWO and CPSO. In distribution optimization example of WSN nodes, the optimal network coverage rate obtained by IIWO is respectively improved by 1.82% and 0.93% than the IWO and CPSO. Under the condition of obtaining the same network coverage rate, the number of nodes required by IIWO is fewer.

scholarly journals A Coverage Optimization Method for WSNs Based on the Improved Weed Algorithm

Sensors ◽  
2021 ◽  
Vol 21 (17) ◽  
pp. 5869
Author(s):  
Fang Zhu ◽  
Wenhao Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Differential Evolution ◽  
Optimization Algorithm ◽  
Optimization Method ◽  
Coverage Rate ◽  
Wireless Sensor ◽  
Fruit Fly Optimization Algorithm ◽  
Invasive Weed ◽  
Coverage Optimization

Wireless sensor networks (WSNs) is a multi-hop wireless network composed of a group of static or mobile sensor nodes in the form of self-organization. Uneven distribution of nodes often leads to the problem of over coverage and incomplete coverage of monitoring areas. To solve this problem, this paper establishes a network coverage optimization model and proposes a coverage optimization method based on an improved hybrid strategy weed algorithm (LRDE_IWO). The improvement of the weed algorithm includes three steps. Firstly, the standard deviation of normal distribution based on the tangent function is used as the seed’s new step size in the seed diffusion stage to balance the ability of the global search and local search of weed algorithm. Secondly, to avoid the problem of premature convergence, a disturbance mechanism combining enhanced Levy flight and the adaptive random walk strategy is proposed in the process of seed breeding. Finally, in competition of invasive weed stage, the differential evolution strategy is introduced to optimize the competition operation process and speed up convergence. The improved weed algorithm is applied to coverage optimization of WSNs. The simulation results show that the coverage rate of LRDE_IWO is increased by about 1% to 6% compared with the original invade weed algorithm (IWO) and the differential evolution invasive weed optimization algorithm (DE_IWO), and the coverage rate of the LRDE_IWO algorithm is increased by 4.10%, 2.73% and 1.19%, respectively, compared with the antlion optimization algorithm (ALO), the fruit fly optimization algorithm (FOA) and the gauss mutation weed algorithm (IIWO). The results prove the superiority and validity of the improved weed algorithm for coverage optimization of wireless sensor networks.

An Adaptive Invasive Weed Optimization Algorithm

2015 ◽  
Vol 29 (02) ◽  
pp. 1559004 ◽  
Author(s):  
Shuo Peng ◽  
A.-J. Ouyang ◽  
Jeff Jun Zhang
Keyword(s):  
Optimization Algorithm ◽  
Initial Step ◽  
Local Extremum ◽  
Invasive Weed Optimization ◽  
Step Size ◽  
Invasive Weed ◽  
Adaptive Step Size ◽  
Initial Step Size ◽  
Adaptive Step ◽  
Optimization Search

With regards to the low search accuracy of the basic invasive weed optimization algorithm which is easy to get into local extremum, this paper proposes an adaptive invasive weed optimization (AIWO) algorithm. The algorithm sets the initial step size and the final step size as the adaptive step size to guide the global search of the algorithm, and it is applied to 20 famous benchmark functions for a test, the results of which show that the AIWO algorithm owns better global optimization search capacity, faster convergence speed and higher computation accuracy compared with other advanced algorithms.

scholarly journals Improved whale optimization algorithm and its application in heterogeneous wireless sensor networks

2021 ◽  
Vol 17 (5) ◽  
pp. 155014772110181
Author(s):  
Yinggao Yue ◽  
Hairong You ◽  
Shuxin Wang ◽  
Li Cao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Optimization Algorithm ◽  
Whale Optimization Algorithm ◽  
Wireless Sensor ◽  
Network Coverage ◽  
Coverage Optimization ◽  
Network Cost ◽  
Whale Optimization ◽  
Heterogeneous Wireless Sensor Networks

Aiming at the problems of node redundancy and network cost increase in heterogeneous wireless sensor networks, this article proposes an improved whale optimization algorithm coverage optimization method. First, establish a mathematical model that balances node utilization, coverage, and energy consumption. Second, use the sine–cosine algorithm to improve the whale optimization algorithm and change the convergence factor of the original algorithm. The linear decrease is changed to the nonlinear decrease of the cosine form, which balances the global search and local search capabilities, and adds the inertial weight of the synchronous cosine form to improve the optimization accuracy and speed up the search speed. The improved whale optimization algorithm solves the heterogeneous wireless sensor network coverage optimization model and obtains the optimal coverage scheme. Simulation experiments show that the proposed method can effectively improve the network coverage effect, as well as the utilization rate of nodes, and reduce network cost consumption.

Comparative investigation of the moth-flame algorithm and whale optimization algorithm for optimal spur gear design

2021 ◽  
Vol 63 (3) ◽  
pp. 266-271
Author(s):  
Hammoudi Abderazek ◽  
Ferhat Hamza ◽  
Ali Riza Yildiz ◽  
Sadiq M. Sait
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problem ◽  
Spur Gear ◽  
Comparative Investigation ◽  
Whale Optimization Algorithm ◽  
Solution Quality ◽  
Gear Design ◽  
Geometric Conditions ◽  
Swarm Algorithms ◽  
Whale Optimization

Abstract In this study, two recent algorithms, the whale optimization algorithm and moth-flame optimization, are used to optimize spur gear design. The objective function is the minimization of the total weight of the spur gear pair. Moreover, the optimization problem is subjected to constraints on the main kinematic and geometric conditions as well as to the resistance of the material of the gear system. The comparison between moth-flame optimization (MFO), the whale optimization algorithm (WOA), and previous studies indicate that the final results obtained from both algorithms lead to a reduction in gear weight by 1.05 %. MFO and the WOA are compared with four additional swarm algorithms. The experimental results indicate that the algorithms introduced here, in particular MFO, outperform the four other methods when compared in terms of solution quality, robustness, and high success rate.

Sign in / Sign up

Export Citation Format

Share Document