An Adaptive, Discrete Space Oriented Wolf Pack Optimization Algorithm for a Movable Wireless Sensor Network.

Clicks: 242
ID: 60436
2019
Article Quality & Performance Metrics
Overall Quality Improving Quality
0.0 /100
Combines engagement data with AI-assessed academic quality
AI Quality Assessment
Not analyzed
Abstract
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.
Reference Key
wang2019ansensors Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Wang, Dongxing;Wang, Huibo;Ban, Xiaojuan;Qian, Xu;Ni, Jingxiu;
Journal sensors
Year 2019
DOI
E4320
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.