Coverage Optimization Algorithm of Wireless Sensor Network

Author(s):  
Xuezheng Han ◽  
Shuai Li ◽  
Xun Pang
2016 ◽  
Vol 12 (08) ◽  
pp. 45 ◽  
Author(s):  
Li Zhu ◽  
Chunxiao Fan ◽  
Huarui Wu ◽  
Zhigang Wen

<span style="font-family: 'Times New Roman',serif; font-size: 10pt; -ms-layout-grid-mode: line; mso-fareast-font-family: SimSun; mso-fareast-theme-font: minor-fareast; mso-ansi-language: EN-US; mso-fareast-language: EN-US; mso-bidi-language: AR-SA;">To reduce the blind zone in network coverage, we propose a coverage optimization algorithm of wireless sensor network based on mobile nodes. This algorithm calculates the irregularity of blind zone in network coverage and obtains the minimum approximate numerical solution by utilizing the quantitative relationship between energy consumption of related nodes and the position of the mobile nodes. After determining the optimal relative position of the mobile nodes, the problem of blind zone between the static nodes is addressed. Simulation result shows that the proposed algorithm has high dynamic adaptability and can address the problem of blind zone maximally. Besides increasing the network coverage, the algorithm also reduces the network energy consumption, optimizes network coverage control and exhibits high convergence. </span>


Sensors ◽  
2019 ◽  
Vol 19 (12) ◽  
pp. 2735 ◽  
Author(s):  
Shipeng Wang ◽  
Xiaoping Yang ◽  
Xingqiao Wang ◽  
Zhihong Qian

The random placement of a large-scale sensor network in an outdoor environment often causes low coverage. In order to effectively improve the coverage of a wireless sensor network in the monitoring area, a coverage optimization algorithm for wireless sensor networks with a Virtual Force-Lévy-embedded Grey Wolf Optimization (VFLGWO) algorithm is proposed. The simulation results show that the VFLGWO algorithm has a better optimization effect on the coverage rate, uniformity, and average moving distance of sensor nodes than a wireless sensor network coverage optimization algorithm using Lévy-embedded Grey Wolf Optimizer, Cuckoo Search algorithm, and Chaotic Particle Swarm Optimization. The VFLGWO algorithm has good adaptability with respect to changes of the number of sensor nodes and the size of the monitoring area.


Sensors ◽  
2019 ◽  
Vol 19 (19) ◽  
pp. 4320 ◽  
Author(s):  
Wang ◽  
Wang ◽  
Ban ◽  
Qian ◽  
Ni

Recently, many related algorithms have been proposed to find an efficient wireless sensor network with good sustainability, a stable connection, and a high covering rate. To further improve the coverage rate of movable wireless sensor networks under the condition of guaranteed connectivity, this paper proposes an adaptive, discrete space oriented wolf pack optimization algorithm for a movable wireless sensor network (DSO-WPOA). Firstly, a strategy of adaptive expansion based on a minimum overlapping full-coverage model is designed to achieve minimum overlap and no-gap coverage for the monitoring area. Moreover, the adaptive shrinking grid search wolf pack optimization algorithm (ASGS-CWOA) is improved to optimize the movable wireless sensor network, which is a discrete space oriented problem. This improvement includes the usage of a target–node probability matrix and the design of an adaptive step size method, both of which work together to enhance the convergence speed and global optimization ability of the algorithm. Theoretical research and experimental results indicate that compared with the coverage algorithm based on particle swarm optimization (PSO-WSN) and classical virtual force algorithm, the newly proposed algorithm possesses the best coverage rate, better stability, acceptable performance in terms of time, advantages in energy savings, and no gaps.


Sign in / Sign up

Export Citation Format

Share Document