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

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 ε . The proposed algorithm maximizes the lifetime of wireless sensor networks to monitor the a...

Full description

Saved in:
Bibliographic Details
Main Authors: Ning-ning Qin, Jia-le Chen
Format: Article
Language:English
Published: Wiley 2018-08-01
Series:International Journal of Distributed Sensor Networks
Online Access:https://doi.org/10.1177/1550147718796734
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1850162085022924800
author Ning-ning Qin
Jia-le Chen
author_facet Ning-ning Qin
Jia-le Chen
author_sort Ning-ning Qin
collection DOAJ
description 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 ε . 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 ε -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.
format Article
id doaj-art-fd8ee5f124ae418cb8e1e65da2c8bc4a
institution OA Journals
issn 1550-1477
language English
publishDate 2018-08-01
publisher Wiley
record_format Article
series International Journal of Distributed Sensor Networks
spelling doaj-art-fd8ee5f124ae418cb8e1e65da2c8bc4a2025-08-20T02:22:39ZengWileyInternational Journal of Distributed Sensor Networks1550-14772018-08-011410.1177/1550147718796734An area coverage algorithm for wireless sensor networks based on differential evolutionNing-ning QinJia-le ChenLifetime 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 ε . 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 ε -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.https://doi.org/10.1177/1550147718796734
spellingShingle Ning-ning Qin
Jia-le Chen
An area coverage algorithm for wireless sensor networks based on differential evolution
International Journal of Distributed Sensor Networks
title An area coverage algorithm for wireless sensor networks based on differential evolution
title_full An area coverage algorithm for wireless sensor networks based on differential evolution
title_fullStr An area coverage algorithm for wireless sensor networks based on differential evolution
title_full_unstemmed An area coverage algorithm for wireless sensor networks based on differential evolution
title_short An area coverage algorithm for wireless sensor networks based on differential evolution
title_sort area coverage algorithm for wireless sensor networks based on differential evolution
url https://doi.org/10.1177/1550147718796734
work_keys_str_mv AT ningningqin anareacoveragealgorithmforwirelesssensornetworksbasedondifferentialevolution
AT jialechen anareacoveragealgorithmforwirelesssensornetworksbasedondifferentialevolution
AT ningningqin areacoveragealgorithmforwirelesssensornetworksbasedondifferentialevolution
AT jialechen areacoveragealgorithmforwirelesssensornetworksbasedondifferentialevolution