Polynomial time algorithm for solving k-coverage problem in wireless sensor networks
How to solve the k-coverage problem,which was divided into worst-case and best-case,inside the two-dimensional target area in wireless sensor networks was explored,and a polynomial time algorithm for solving this problem was put forward.In this algorithm,a series of definitions and theorems were pro...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Beijing Xintong Media Co., Ltd
2017-12-01
|
| Series: | Dianxin kexue |
| Subjects: | |
| Online Access: | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2017287/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850090912058703872 |
|---|---|
| author | Qi WANG Zheng’an XIAO Huaixing WANG |
| author_facet | Qi WANG Zheng’an XIAO Huaixing WANG |
| author_sort | Qi WANG |
| collection | DOAJ |
| description | How to solve the k-coverage problem,which was divided into worst-case and best-case,inside the two-dimensional target area in wireless sensor networks was explored,and a polynomial time algorithm for solving this problem was put forward.In this algorithm,a series of definitions and theorems were proposed based on the geometric graph of growing disks,and the k-coverage problem was transformed into one of finding a series of adjacent borders.The simulation results show that the algorithm could compute the optimal k-breach path and k-support path in polynomial time,so as to avoid or select the network coverage reasonably. |
| format | Article |
| id | doaj-art-90ff85f7ee76486fab672a10138f90f0 |
| institution | DOAJ |
| issn | 1000-0801 |
| language | zho |
| publishDate | 2017-12-01 |
| publisher | Beijing Xintong Media Co., Ltd |
| record_format | Article |
| series | Dianxin kexue |
| spelling | doaj-art-90ff85f7ee76486fab672a10138f90f02025-08-20T02:42:28ZzhoBeijing Xintong Media Co., LtdDianxin kexue1000-08012017-12-0133919859598490Polynomial time algorithm for solving k-coverage problem in wireless sensor networksQi WANGZheng’an XIAOHuaixing WANGHow to solve the k-coverage problem,which was divided into worst-case and best-case,inside the two-dimensional target area in wireless sensor networks was explored,and a polynomial time algorithm for solving this problem was put forward.In this algorithm,a series of definitions and theorems were proposed based on the geometric graph of growing disks,and the k-coverage problem was transformed into one of finding a series of adjacent borders.The simulation results show that the algorithm could compute the optimal k-breach path and k-support path in polynomial time,so as to avoid or select the network coverage reasonably.http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2017287/wireless sensor networkk-coverage problemgrowing diskadjacent borderpolynomial time algo-rithm |
| spellingShingle | Qi WANG Zheng’an XIAO Huaixing WANG Polynomial time algorithm for solving k-coverage problem in wireless sensor networks Dianxin kexue wireless sensor network k-coverage problem growing disk adjacent border polynomial time algo-rithm |
| title | Polynomial time algorithm for solving k-coverage problem in wireless sensor networks |
| title_full | Polynomial time algorithm for solving k-coverage problem in wireless sensor networks |
| title_fullStr | Polynomial time algorithm for solving k-coverage problem in wireless sensor networks |
| title_full_unstemmed | Polynomial time algorithm for solving k-coverage problem in wireless sensor networks |
| title_short | Polynomial time algorithm for solving k-coverage problem in wireless sensor networks |
| title_sort | polynomial time algorithm for solving k coverage problem in wireless sensor networks |
| topic | wireless sensor network k-coverage problem growing disk adjacent border polynomial time algo-rithm |
| url | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2017287/ |
| work_keys_str_mv | AT qiwang polynomialtimealgorithmforsolvingkcoverageprobleminwirelesssensornetworks AT zhenganxiao polynomialtimealgorithmforsolvingkcoverageprobleminwirelesssensornetworks AT huaixingwang polynomialtimealgorithmforsolvingkcoverageprobleminwirelesssensornetworks |