Solving wireless sensor network coverage problem using LAEDA
Coverage improvement is one of the main problems in wireless sensor networks. Given a finite number of sensors, improvement of the sensor deployment will provide sufficient sensor coverage and save cost of sensors for locating in grid points. For achieving good coverage, the sensors should be placed...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | EJournal Article |
| Published: |
Institute of Advanced Engineering and Science,
2020-04-01.
|
| Subjects: | |
| Online Access: | Get fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Coverage improvement is one of the main problems in wireless sensor networks. Given a finite number of sensors, improvement of the sensor deployment will provide sufficient sensor coverage and save cost of sensors for locating in grid points. For achieving good coverage, the sensors should be placed in adequate places. In this article, estimation of distribution algorithm based on learning automata is presented for solving the sensor placement (LAEDA-SP) in distributed sensor networks by considering two factors: 1) the complete coverage and 2) the minimum costs. The proposed algorithm is a model based on search optimization method that uses a set of learning automata as a probabilistic model of high-quality solutions seen in the search process. It is applied in a various area with different size. The results not only confirmed the successes of using the new method in sensor replacement but also they showed that the proposed method performs more efficiently compared to the state-of-the-art methods such as simulated annealing (SA) and population-based incremental learning algorithms (PBIL). |
|---|---|
| Item Description: | https://ijeecs.iaescore.com/index.php/IJEECS/article/view/18272 |