An Optimized Strategy Coverage Control Algorithm for WSN
The problem of using lesser wireless sensor network nodes to achieve coverage and connection of certain areas under given coverage conditions is a priority and hotspot issue of WSN. For this reason, in this paper, an optimized strategy coverage control (OSCC) algorithm is proposed. First of all, a r...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-07-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2014/976307 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849700807420674048 |
|---|---|
| author | Zeyu Sun Weiguo Wu Huanzhao Wang Heng Chen Wei Wei |
| author_facet | Zeyu Sun Weiguo Wu Huanzhao Wang Heng Chen Wei Wei |
| author_sort | Zeyu Sun |
| collection | DOAJ |
| description | The problem of using lesser wireless sensor network nodes to achieve coverage and connection of certain areas under given coverage conditions is a priority and hotspot issue of WSN. For this reason, in this paper, an optimized strategy coverage control (OSCC) algorithm is proposed. First of all, a relation mapping model of sensor nodes and target nodes is established by OSCC which is based on geometric figure and related theories, probability theory, converge property, and so forth to complete effective reasoning and calculate certain network models. Secondly, OSCC makes efficient analysis of the calculating results figure out the least number of sensor nodes to cover specific monitoring area. Thirdly, OSCC picks out the optimal routing solution while conducting combinatorial optimization of routing path using ant colony optimization (ACO) algorithm, thus reducing the energy spending of whole network. In the end, this paper verifies OSCC algorithm by simulation experiment and proves it can use least sensor nodes to effectively cover target area. Also, OSCC helps greatly reduce network energy consuming, minimize network resources layout costs, and enhance network life cycle, simultaneously. |
| format | Article |
| id | doaj-art-65401dc23fbe4093ac01ecd7fc449731 |
| institution | DOAJ |
| issn | 1550-1477 |
| language | English |
| publishDate | 2014-07-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-65401dc23fbe4093ac01ecd7fc4497312025-08-20T03:18:09ZengWileyInternational Journal of Distributed Sensor Networks1550-14772014-07-011010.1155/2014/976307976307An Optimized Strategy Coverage Control Algorithm for WSNZeyu Sun0Weiguo Wu1Huanzhao Wang2Heng Chen3Wei Wei4 Computer and Information Engineering Department, Luoyang Institute of Technology, Luoyang, Henan 471023, China School of Electronics and Information Engineering, Xi'an Jiaotong University, Xi'an, Shanxi 710049, China School of Electronics and Information Engineering, Xi'an Jiaotong University, Xi'an, Shanxi 710049, China School of Electronics and Information Engineering, Xi'an Jiaotong University, Xi'an, Shanxi 710049, China School of Computer Science and Engineering, Xi'an University of Technology, Xi'an, Shanxi 710048, ChinaThe problem of using lesser wireless sensor network nodes to achieve coverage and connection of certain areas under given coverage conditions is a priority and hotspot issue of WSN. For this reason, in this paper, an optimized strategy coverage control (OSCC) algorithm is proposed. First of all, a relation mapping model of sensor nodes and target nodes is established by OSCC which is based on geometric figure and related theories, probability theory, converge property, and so forth to complete effective reasoning and calculate certain network models. Secondly, OSCC makes efficient analysis of the calculating results figure out the least number of sensor nodes to cover specific monitoring area. Thirdly, OSCC picks out the optimal routing solution while conducting combinatorial optimization of routing path using ant colony optimization (ACO) algorithm, thus reducing the energy spending of whole network. In the end, this paper verifies OSCC algorithm by simulation experiment and proves it can use least sensor nodes to effectively cover target area. Also, OSCC helps greatly reduce network energy consuming, minimize network resources layout costs, and enhance network life cycle, simultaneously.https://doi.org/10.1155/2014/976307 |
| spellingShingle | Zeyu Sun Weiguo Wu Huanzhao Wang Heng Chen Wei Wei An Optimized Strategy Coverage Control Algorithm for WSN International Journal of Distributed Sensor Networks |
| title | An Optimized Strategy Coverage Control Algorithm for WSN |
| title_full | An Optimized Strategy Coverage Control Algorithm for WSN |
| title_fullStr | An Optimized Strategy Coverage Control Algorithm for WSN |
| title_full_unstemmed | An Optimized Strategy Coverage Control Algorithm for WSN |
| title_short | An Optimized Strategy Coverage Control Algorithm for WSN |
| title_sort | optimized strategy coverage control algorithm for wsn |
| url | https://doi.org/10.1155/2014/976307 |
| work_keys_str_mv | AT zeyusun anoptimizedstrategycoveragecontrolalgorithmforwsn AT weiguowu anoptimizedstrategycoveragecontrolalgorithmforwsn AT huanzhaowang anoptimizedstrategycoveragecontrolalgorithmforwsn AT hengchen anoptimizedstrategycoveragecontrolalgorithmforwsn AT weiwei anoptimizedstrategycoveragecontrolalgorithmforwsn AT zeyusun optimizedstrategycoveragecontrolalgorithmforwsn AT weiguowu optimizedstrategycoveragecontrolalgorithmforwsn AT huanzhaowang optimizedstrategycoveragecontrolalgorithmforwsn AT hengchen optimizedstrategycoveragecontrolalgorithmforwsn AT weiwei optimizedstrategycoveragecontrolalgorithmforwsn |