Research On Coverage Holes Repair In Wireless Sensor Networks Based On Improved Artificial Fish Swarm Algorithm

Author(s):  
Dongliang Li
2021 ◽  
Vol 17 (4) ◽  
pp. 155014772199229
Author(s):  
Shuxin Wang ◽  
Hairong You ◽  
Yinggao Yue ◽  
Li Cao

Aiming at the key optimization problems of wireless sensor networks in complex industrial application environments, such as the optimum coverage and the reliability of the network, a novel topology optimization of coverage-oriented strategy for wireless sensor networks based on the wolf pack algorithm is proposed. Combining the characteristics of topology structure of wireless sensor networks and the optimization idea of the wolf pack algorithm redefines the group’s wandering and surprise behavior. A novel head wolf mutation strategy is proposed, which increases the neighborhood search range of the optimal solution, enhances the uniformity of wolf pack distribution and the ergodicity ability of the wolf pack search, and greatly improves the calculation speed and the accuracy of the wolf pack algorithm. With the same probability, the cluster heads are randomly selected periodically, and the overall energy consumption of wireless sensor networks is evenly distributed to the sensor node to realize the balanced distribution of the data of the member nodes in the cluster and complete the design of the topology optimization of wireless sensor networks. Through algorithm simulation and result analysis, compared with the particle swarm optimization algorithm and artificial fish swarm algorithm, the wolf swarm algorithm shows its advantages in terms of the residual energy of the sensor node, the average transmission delay, the average packet delivery rate, and the coverage of the network. Among them, compared with the particle swarm optimization algorithm and artificial fish swarm algorithm, the remaining energy of nodes has increased by 9.5% and 15.5% and the average coverage of the network has increased by 10.5% and 5.6%, respectively.


2016 ◽  
Vol 2016 ◽  
pp. 1-16 ◽  
Author(s):  
Li-Hui Zhao ◽  
Wenyi Liu ◽  
Haiwei Lei ◽  
Ruixia Zhang ◽  
Qiulin Tan

The emergence of coverage holes in wireless sensor networks (WSNs) means that some special events have broken out and the function of WSNs will be seriously influenced. Therefore, the issues of coverage holes have attracted considerable attention. In this paper, we focus on the identification of boundary nodes and coverage holes, which is crucially important to preventing the enlargement of coverage holes and ensuring the transmission of data. We define the problem of coverage holes and propose two novel algorithms to identify the coverage holes in WSNs. The first algorithm, Distributed Sector Cover Scanning (DSCS), can be used to identify the nodes on hole borders and the outer boundary of WSNs. The second scheme, Directional Walk (DW), can locate the coverage holes based on the boundary nodes identified with DSCS. We implement the algorithms in various scenarios and fully evaluate their performance. The simulation results show that the boundary nodes can be accurately detected by DSCS and the holes enclosed by the detected boundary nodes can be identified by DW. The comparisons confirm that the proposed algorithms outperform the existing ones.


Sign in / Sign up

Export Citation Format

Share Document