scholarly journals A novel pigeon-inspired optimization with QUasi-Affine TRansformation evolutionary algorithm for DV-Hop in wireless sensor networks

2020 ◽  
Vol 16 (6) ◽  
pp. 155014772093274 ◽  
Author(s):  
Xiao-Xue Sun ◽  
Jeng-Shyang Pan ◽  
Shu-Chuan Chu ◽  
Pei Hu ◽  
Ai-Qing Tian
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Evolutionary Algorithm ◽  
Optimization Algorithm ◽  
Affine Transformation ◽  
Optimal Solution ◽  
Wireless Sensor ◽  
Local Optimum ◽  
Search Range ◽  
Homing Behavior

In modern times, swarm intelligence has played an increasingly important role in finding an optimal solution within a search range. This study comes up with a novel solution algorithm named QUasi-Affine TRansformation-Pigeon-Inspired Optimization Algorithm, which uses an evolutionary matrix in QUasi-Affine TRansformation Evolutionary Algorithm for the Pigeon-Inspired Optimization Algorithm that was designed using the homing behavior of pigeon. We abstract the pigeons into particles of no quality and improve the learning strategy of the particles. Having different update strategies, the particles get more scientific movement and space exploration on account of adopting the matrix of the QUasi-Affine TRansformation Evolutionary algorithm. It increases the versatility of the Pigeon-Inspired Optimization algorithm and makes the Pigeon-Inspired Optimization less simple. This new algorithm effectively improves the shortcoming that is liable to fall into local optimum. Under a number of benchmark functions, our algorithm exhibits good optimization performance. In wireless sensor networks, there are still some problems that need to be optimized, for example, the error of node positioning can be further reduced. Hence, we attempt to apply the proposed optimization algorithm in terms of positioning, that is, integrating the QUasi-Affine TRansformation-Pigeon-Inspired Optimization algorithm into the Distance Vector–Hop algorithm. Simultaneously, the algorithm verifies its optimization ability by node location. According to the experimental results, they demonstrate that it is more outstanding than the Pigeon-Inspired Optimization algorithm, the QUasi-Affine TRansformation Evolutionary algorithm, and particle swarm optimization algorithm. Furthermore, this algorithm shows up minor errors and embodies a much more accurate location.

scholarly journals An Adaptation Multi-Group Quasi-Affine Transformation Evolutionary Algorithm for Global Optimization and Its Application in Node Localization in Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (19) ◽  
pp. 4112 ◽  
Author(s):  
Nengxian Liu ◽  
Jeng-Shyang Pan ◽  
Jin Wang ◽  
Trong-The Nguyen
Keyword(s):  
Wireless Sensor Networks ◽  
Global Optimization ◽  
Sensor Networks ◽  
Evolutionary Algorithm ◽  
Affine Transformation ◽  
Optimization Problems ◽  
Population Diversity ◽  
Wireless Sensor ◽  
Node Localization ◽  
Mutation Strategy

Developing metaheuristic algorithms has been paid more recent attention from researchers and scholars to address the optimization problems in many fields of studies. This paper proposes a novel adaptation of the multi-group quasi-affine transformation evolutionary algorithm for global optimization. Enhanced population diversity for adaptation multi-group quasi-affine transformation evolutionary algorithm is implemented by randomly dividing its population into three groups. Each group adopts a mutation strategy differently for improving the efficiency of the algorithm. The scale factor F of mutations is updated adaptively during the search process with the different policies along with proper parameter to make a better trade-off between exploration and exploitation capability. In the experimental section, the CEC2013 test suite and the node localization in wireless sensor networks were used to verify the performance of the proposed algorithm. The experimental results are compared results with three quasi-affine transformation evolutionary algorithm variants, two different evolution variants, and two particle swarm optimization variants show that the proposed adaptation multi-group quasi-affine transformation evolutionary algorithm outperforms the competition algorithms. Moreover, analyzed results of the applied adaptation multi-group quasi-affine transformation evolutionary for node localization in wireless sensor networks showed that the proposed method produces higher localization accuracy than the other competing algorithms.

A MAC Layer Optimization Algorithm in Wireless Sensor Networks

2012 ◽  
Vol 35 (3) ◽  
pp. 529-539 ◽  
Author(s):  
Yun-Lu LIU ◽  
Ju-Hua PU ◽  
Wei-Wei FANG ◽  
Zhang XIONG
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Optimization Algorithm ◽  
Wireless Sensor ◽  
Mac Layer

scholarly journals An Uneven Node Self-Deployment Optimization Algorithm for Maximized Coverage and Energy Balance in Underwater Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1368 ◽  
Author(s):  
Luoheng Yan ◽  
Yuyao He ◽  
Zhongmin Huangfu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Balance ◽  
Optimization Algorithm ◽  
Growth Ring ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Connected Network ◽  
Deployment Optimization

The underwater wireless sensor networks (UWSNs) have been applied in lots of fields such as environment monitoring, military surveillance, data collection, etc. Deployment of sensor nodes in 3D UWSNs is a crucial issue, however, it is a challenging problem due to the complex underwater environment. This paper proposes a growth ring style uneven node depth-adjustment self-deployment optimization algorithm (GRSUNDSOA) to improve the coverage and reliability of UWSNs, meanwhile, and to solve the problem of energy holes. In detail, a growth ring style-based scheme is proposed for constructing the connective tree structure of sensor nodes and a global optimal depth-adjustment algorithm with the goal of comprehensive optimization of both maximizing coverage utilization and energy balance is proposed. Initially, the nodes are scattered to the water surface to form a connected network on this 2D plane. Then, starting from sink node, a growth ring style increment strategy is presented to organize the common nodes as tree structures and each root of subtree is determined. Meanwhile, with the goal of global maximizing coverage utilization and energy balance, all nodes depths are computed iteratively. Finally, all the nodes dive to the computed position once and a 3D underwater connected network with non-uniform distribution and balanced energy is constructed. A series of simulation experiments are performed. The simulation results show that the coverage and reliability of UWSN are improved greatly under the condition of full connectivity and energy balance, and the issue of energy hole can be avoided effectively. Therefore, GRSUNDSOA can prolong the lifetime of UWSN significantly.

scholarly journals A Novel Bioinspired Multiobjective Optimization Algorithm for Designing Wireless Sensor Networks in the Internet of Things

2015 ◽  
Vol 2015 ◽  
pp. 1-16 ◽  
Author(s):  
Jun Huang ◽  
Liqian Xu ◽  
Cong-cong Xing ◽  
Qiang Duan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Internet Of Things ◽  
Multiobjective Optimization ◽  
Optimization Algorithm ◽  
Chaotic Behavior ◽  
Ant Colony ◽  
Wireless Sensor ◽  
The Internet ◽  
The Internet Of Things

The design of wireless sensor networks (WSNs) in the Internet of Things (IoT) faces many new challenges that must be addressed through an optimization of multiple design objectives. Therefore, multiobjective optimization is an important research topic in this field. In this paper, we develop a new efficient multiobjective optimization algorithm based on the chaotic ant swarm (CAS). Unlike the ant colony optimization (ACO) algorithm, CAS takes advantage of both the chaotic behavior of a single ant and the self-organization behavior of the ant colony. We first describe the CAS and its nonlinear dynamic model and then extend it to a multiobjective optimizer. Specifically, we first adopt the concepts of “nondominated sorting” and “crowding distance” to allow the algorithm to obtain the true or near optimum. Next, we redefine the rule of “neighbor” selection for each individual (ant) to enable the algorithm to converge and to distribute the solutions evenly. Also, we collect the current best individuals within each generation and employ the “archive-based” approach to expedite the convergence of the algorithm. The numerical experiments show that the proposed algorithm outperforms two leading algorithms on most well-known test instances in terms of Generational Distance, Error Ratio, and Spacing.

Sign in / Sign up

Export Citation Format

Share Document