An area coverage algorithm for wireless sensor networks based on differential evolution

Abstract

Lifetime requirements and coverage demands are emphasized in wireless sensor networks. An area coverage algorithm based on differential evolution is developed in this study to obtain a given coverage ratio e. The proposed algorithm maximizes the lifetime of wireless sensor networks to monitor the area of interest. To this end, we translate continuous area coverage into classical discrete point coverage, so that the optimization process can be realized by wireless sensor networks. Based on maintaining the e-coverage performance, area coverage algorithm based on differential evolution takes the minimal energy as optimization objective. In area coverage algorithm based on differential evolution, binary differential evolution is redeveloped to search for an improved node subset and thus meet the coverage demand. Taking into account that the results of binary differential evolution are depended on the initial value, the resulting individual is not an absolutely perfect node subset. A compensation strategy is provided to avoid unbalanced energy consumption for the obtained node subset by introducing the positive and negative utility ratios. Under the helps of those ratios and compensation strategy, the resulting node subset can be added additional nodes to remedy insufficient coverage, and redundancy active nodes can be pushed into sleep state. Furthermore, balance and residual energy are considered in area coverage algorithm based on differential evolution, which can expand the scope of population exploration and accelerate convergence. Experimental results show that area coverage algorithm based on differential evolution possesses high energy and computation efficiencies and provides 90% network coverage.

Energy Harvesting and Information Transmission Mode Design for Cooperative EH-Abled IoT Applications in beyond 5G Networks

“…For WOA, the parameter settings can refer to [42]. For DEA, the parameter settings of DEA can refer to [46]. Figures 3 and 7 give the comparison results of QWOA and two classical continuous intelligent algorithms when considering equations (20) and (21) as optimization object, respectively.…”

A Virtual Force Algorithm-Lévy-Embedded Grey Wolf Optimization Algorithm for Wireless Sensor Network Coverage Optimization

“…The research on using swarm intelligence optimization algorithms to solve WSN coverage optimization problems is gradually increasing. Ning-ning Qin and Leopoldo Eduardo Cárdenas-Barrón [9,10] applied differential evolution and its improved algorithm to complete wireless sensor node deployment. Differential evolution has the characteristics of a simple structure, easy implementation, fast convergence, and strong robustness.…”

Sensor Node Activation Using Bat Algorithm for Connected Target Coverage in WSNs

“…Therefore, a good candidate method for this is a nature-inspired algorithm (NIA). NIAs imitating natural phenomena have been used in various fields, including to solve various types of coverage problems in WSNs [ 14 , 15 , 16 , 17 , 18 , 19 , 20 , 21 ]. However, in our knowledge, there is no NIA-based node activation method which considers both the probabilistic sensing model and connectivity for the target coverage problem.…”