A Path Planning Method for Chargeable Sweep Coverage With Multiple Charging Stations
The energy limit would abbreviate the lifetime of sweep coverage network. Wireless charging technology might be the best way to extend the lifetime of sweep coverage networks, as sensors are required to constantly move to ensure periodic target coverage. This paper studies the sweep coverage facilit...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2024-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10459170/ |
| _version_ | 1797243398989545472 |
|---|---|
| author | Dieyan Liang Baojian Feng Xuefeng Liao |
| author_facet | Dieyan Liang Baojian Feng Xuefeng Liao |
| author_sort | Dieyan Liang |
| collection | DOAJ |
| description | The energy limit would abbreviate the lifetime of sweep coverage network. Wireless charging technology might be the best way to extend the lifetime of sweep coverage networks, as sensors are required to constantly move to ensure periodic target coverage. This paper studies the sweep coverage facilitated by rechargeable sensors, which persistently navigate between target nodes and charging stations to fulfill the periodic coverage demands of the targets while ensuring they return to the charging stations before their energy runs out. This paper firstly proposes a general definition of the Chargeable Sweep Coverage (CSC) problem, and studies the CSC problem by examining various constraints. We also propose one CSC problem subject to a special constraint where the sensors must return to their initial charging stations to recharge. The CSC problem under constrain is also NP-hard. In this paper, the problem is modeled as Maximum nodes inclusion problem with unbound candidate paths. We discuss the effective paths of the problems by situation, bound the candidate paths to certain lengths using discretization technology, and employ existing approximation algorithms to get the approximation solutions. When the charging period is greater than the sweep period, we get a <inline-formula> <tex-math notation="LaTeX">$\frac {2}{5}$ </tex-math></inline-formula>-approximation algorithm. For the opposite, we get <inline-formula> <tex-math notation="LaTeX">$\frac {1}{6}$ </tex-math></inline-formula>-approximation algorithms for it. The validity and scalability of the proposed algorithms are proved by theoretical proofs and experimental simulations. |
| first_indexed | 2024-04-24T18:54:29Z |
| format | Article |
| id | doaj.art-df2ab0a8a1ab44089e75527458cc0d7f |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-04-24T18:54:29Z |
| publishDate | 2024-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-df2ab0a8a1ab44089e75527458cc0d7f2024-03-26T17:46:40ZengIEEEIEEE Access2169-35362024-01-0112349313494110.1109/ACCESS.2024.337354310459170A Path Planning Method for Chargeable Sweep Coverage With Multiple Charging StationsDieyan Liang0Baojian Feng1https://orcid.org/0009-0007-6101-1167Xuefeng Liao2School of Computer Science and Engineering, Huizhou University, Huizhou, ChinaNetwork and Information Center, Huizhou University, Huizhou, ChinaSchool of Data Science and Artificial Intelligence, Wenzhou University of Technology, Wenzhou, ChinaThe energy limit would abbreviate the lifetime of sweep coverage network. Wireless charging technology might be the best way to extend the lifetime of sweep coverage networks, as sensors are required to constantly move to ensure periodic target coverage. This paper studies the sweep coverage facilitated by rechargeable sensors, which persistently navigate between target nodes and charging stations to fulfill the periodic coverage demands of the targets while ensuring they return to the charging stations before their energy runs out. This paper firstly proposes a general definition of the Chargeable Sweep Coverage (CSC) problem, and studies the CSC problem by examining various constraints. We also propose one CSC problem subject to a special constraint where the sensors must return to their initial charging stations to recharge. The CSC problem under constrain is also NP-hard. In this paper, the problem is modeled as Maximum nodes inclusion problem with unbound candidate paths. We discuss the effective paths of the problems by situation, bound the candidate paths to certain lengths using discretization technology, and employ existing approximation algorithms to get the approximation solutions. When the charging period is greater than the sweep period, we get a <inline-formula> <tex-math notation="LaTeX">$\frac {2}{5}$ </tex-math></inline-formula>-approximation algorithm. For the opposite, we get <inline-formula> <tex-math notation="LaTeX">$\frac {1}{6}$ </tex-math></inline-formula>-approximation algorithms for it. The validity and scalability of the proposed algorithms are proved by theoretical proofs and experimental simulations.https://ieeexplore.ieee.org/document/10459170/Wireless sensor networksmobile sensorssweep coverageapproximation algorithmchargeable |
| spellingShingle | Dieyan Liang Baojian Feng Xuefeng Liao A Path Planning Method for Chargeable Sweep Coverage With Multiple Charging Stations IEEE Access Wireless sensor networks mobile sensors sweep coverage approximation algorithm chargeable |
| title | A Path Planning Method for Chargeable Sweep Coverage With Multiple Charging Stations |
| title_full | A Path Planning Method for Chargeable Sweep Coverage With Multiple Charging Stations |
| title_fullStr | A Path Planning Method for Chargeable Sweep Coverage With Multiple Charging Stations |
| title_full_unstemmed | A Path Planning Method for Chargeable Sweep Coverage With Multiple Charging Stations |
| title_short | A Path Planning Method for Chargeable Sweep Coverage With Multiple Charging Stations |
| title_sort | path planning method for chargeable sweep coverage with multiple charging stations |
| topic | Wireless sensor networks mobile sensors sweep coverage approximation algorithm chargeable |
| url | https://ieeexplore.ieee.org/document/10459170/ |
| work_keys_str_mv | AT dieyanliang apathplanningmethodforchargeablesweepcoveragewithmultiplechargingstations AT baojianfeng apathplanningmethodforchargeablesweepcoveragewithmultiplechargingstations AT xuefengliao apathplanningmethodforchargeablesweepcoveragewithmultiplechargingstations AT dieyanliang pathplanningmethodforchargeablesweepcoveragewithmultiplechargingstations AT baojianfeng pathplanningmethodforchargeablesweepcoveragewithmultiplechargingstations AT xuefengliao pathplanningmethodforchargeablesweepcoveragewithmultiplechargingstations |