Optimal algorithm for min-max line barrier coverage with mobile sensors on 2-dimensional plane
Emerging IoT applications impose line barrier coverage (LBC) tasks with min–max movement objective due to requirements of energy balance, fairness, etc. In LBC, we are given a line barrier and a set of n sensors distributed on the plane. The aim is to move the sensors to fully cover the given barrie...
Saved in:
| Published in: | Computer networks (Amsterdam, Netherlands : 1999) Vol. 228; p. 109717 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
01.06.2023
|
| Subjects: | |
| ISSN: | 1389-1286, 1872-7069 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Emerging IoT applications impose line barrier coverage (LBC) tasks with min–max movement objective due to requirements of energy balance, fairness, etc. In LBC, we are given a line barrier and a set of n sensors distributed on the plane. The aim is to move the sensors to fully cover the given barrier, such that the maximum movement of the mobile sensors is minimized and hence the energy consumption of the sensors are balanced. This paper proposes an exact algorithm to optimally solve LBC, which deserves a runtime On2 compared favorably to the previous state-of-art runtime On2logn. The key idea of the improvement is acceleration-via-approximation: devise a novel approximation algorithm and then use it to accelerate the calculation of optimum solutions. Extensive numerical experiments were carried out to evaluate the practical performance of our algorithm against other baselines, demonstrating its performance gain over the previous state-of-art algorithms. |
|---|---|
| AbstractList | Emerging IoT applications impose line barrier coverage (LBC) tasks with min–max movement objective due to requirements of energy balance, fairness, etc. In LBC, we are given a line barrier and a set of n sensors distributed on the plane. The aim is to move the sensors to fully cover the given barrier, such that the maximum movement of the mobile sensors is minimized and hence the energy consumption of the sensors are balanced. This paper proposes an exact algorithm to optimally solve LBC, which deserves a runtime On2 compared favorably to the previous state-of-art runtime On2logn. The key idea of the improvement is acceleration-via-approximation: devise a novel approximation algorithm and then use it to accelerate the calculation of optimum solutions. Extensive numerical experiments were carried out to evaluate the practical performance of our algorithm against other baselines, demonstrating its performance gain over the previous state-of-art algorithms. |
| ArticleNumber | 109717 |
| Author | Li, Peng Yao, Pei Lin, Jiawei Guo, Longkun |
| Author_xml | – sequence: 1 givenname: Pei surname: Yao fullname: Yao, Pei email: pei.yao@foxmail.com organization: College of Mathematics and Statistics, Anhui Normal University, Wuhu 241002, PR China – sequence: 2 givenname: Longkun orcidid: 0000-0003-2891-4253 surname: Guo fullname: Guo, Longkun email: longkun.guo@fzu.edu.cn organization: School of Computer Science, Qilu University of Technology, Jinan 250301, PR China – sequence: 3 givenname: Peng surname: Li fullname: Li, Peng email: penl@google.com organization: Google LLC, Kirkland, WA, Unite States – sequence: 4 givenname: Jiawei surname: Lin fullname: Lin, Jiawei email: jiawei.lin_1931@foxmail.com organization: College of Computer and Data Science/ College of Software, Fuzhou University, Fuzhou 360116, PR China |
| BookMark | eNp9UMtKQzEUDFLBtvoHLvIDt-Zxcx8bQYovKHSjW0OanNSUm6Qkl6p_b8p17erMGc4MZ2aBZiEGQOiWkhUltLk7rHT0AcYVI4wXqm9pe4HmtGtZ1ZKmnxXMu76irGuu0CLnAyGkrlk3Rx_b4-i8GrAa9jG58dNjGxP2LlRefePBBcA7lZKDhHU8QVJ7wF_lDvu4cwPgDCHHlHEMmFXG-bK6GIrhcVABrtGlVUOGm7-5RO9Pj2_rl2qzfX5dP2wqzYQYK26UKEjXjRVW615pa9p2B4Zxzo2tWS8MZ40A0wDYpu07DcRaVRdCGFB8ierJV6eYcwIrj6nESj-SEnnuSB7k1JE8dySnjorsfpJB-e1UMsqsHQQNxiXQozTR_W_wCwePdo0 |
| Cites_doi | 10.1016/j.pmcj.2022.101653 10.1007/s10878-018-0306-6 10.1016/S0022-0000(73)80033-9 10.1007/s00454-013-9525-x 10.1016/j.adhoc.2010.09.008 10.1016/j.tcs.2009.07.007 10.1002/cpe.6175 10.1109/JSYST.2016.2597171 10.1002/rsa.20656 10.1016/j.comnet.2019.05.011 10.1016/j.comnet.2019.06.019 10.1016/j.comnet.2021.108416 10.1016/j.comnet.2017.07.015 10.1109/TNET.2017.2756925 10.1109/TNET.2018.2867156 10.1016/j.comnet.2020.107207 10.1016/j.tcs.2015.02.006 10.1007/s00454-011-9338-8 10.1016/j.comnet.2016.11.014 10.1007/s10878-006-7909-z |
| ContentType | Journal Article |
| Copyright | 2023 Elsevier B.V. |
| Copyright_xml | – notice: 2023 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.comnet.2023.109717 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1872-7069 |
| ExternalDocumentID | 10_1016_j_comnet_2023_109717 S1389128623001627 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 77K 8P~ AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABBOA ABFNM ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD AXJTR BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F0J FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF HZ~ IHE J1W JJJVA KOM M41 MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 PC. PQQKQ Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SES SEW SPC SPCBC SST SSV SSZ T5K TAE TN5 XFK ZMT ZY4 ~G- 77I 9DU AATTM AAXKI AAYWO AAYXX ABJNI ACLOT ACVFH ADCNI AEIPS AEUPX AFJKZ AFPUW AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c255t-3da5c25c46f5fcc9acfd77bed2333df4295d3265ed6eef6798ce0ffa4ed65dea3 |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000981722700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1389-1286 |
| IngestDate | Sat Nov 29 07:02:08 EST 2025 Fri Feb 23 02:36:48 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Mobile sensor Barrier coverage Exact algorithm Approximation algorithm Optimal solution |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c255t-3da5c25c46f5fcc9acfd77bed2333df4295d3265ed6eef6798ce0ffa4ed65dea3 |
| ORCID | 0000-0003-2891-4253 |
| ParticipantIDs | crossref_primary_10_1016_j_comnet_2023_109717 elsevier_sciencedirect_doi_10_1016_j_comnet_2023_109717 |
| PublicationCentury | 2000 |
| PublicationDate | June 2023 2023-06-00 |
| PublicationDateYYYYMMDD | 2023-06-01 |
| PublicationDate_xml | – month: 06 year: 2023 text: June 2023 |
| PublicationDecade | 2020 |
| PublicationTitle | Computer networks (Amsterdam, Netherlands : 1999) |
| PublicationYear | 2023 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Chenait, Zebbane, Benzaid, Badache (b8) 2017; 127 Yao, Guo, Yu (b16) 2021 Wang, Zhong (b2) 2006; 11 Dobrev, Durocher, Eftekhari, Georgiou, Kranakis, Krizanc, Narayanan, Opatrny, Shende, Urrutia (b13) 2015; 579 Huang, Feng, Wang, Xu (b21) 2021 Shi, Xu, Liu, Zhan (b9) 2020; 175 Cardei, Wu (b1) 2004; 21 Ghannadrezaii, Bousquet (b10) 2019; 160 Zou, Guo, Huang, Lin, Mei (b19) 2022; 34 Mei, Guo, Zou, Huang, Yu, Qin (b20) 2022 Blum, Floyd, Pratt, Rivest, Tarjan (b34) 1973; 7 Balister, Bollobás, Sarkar (b35) 2016; 49 Eriskin (b22) 2021; 198 Wang, Chen, Cao, Qi, Wang, Wang (b28) 2017; 112 Zhang, Wu, Yuan, Du (b31) 2018; 26 Gao, Chen, Wu, Chen (b17) 2017; 25 Zhang, Fan, Lee, Li, Zhao, Liu (b30) 2018; 36 Ali, Ashraf, Qaisar, Afridi, Saeed, Rashid, Felemban, Sheikh (b7) 2016; 12 Czyzowicz, Kranakis, Krizanc, Lambadaris, Narayanan, Opatrny, Stacho, Urrutia, Yazdani (b12) 2009 Bhattacharya, Burmester, Hu, Kranakis, Wiese (b24) 2008; 410 Li, Shen (b4) 2015 Yao, Guo, Li, Lin (b15) 2021 Kumar, Lai, Arora (b11) 2005 Sun, Wang, Vuran, Al-Rodhaan, Al-Dhelaan, Akyildiz (b5) 2011; 9 Mehrandish, Narayanan, Opatrny (b26) 2011 Zhang, Zhou, Zhang, Lee, Li (b29) 2017; 47 Chen, Gu, Li, Wang (b3) 2013; 50 Czyzowicz, Kranakis, Krizanc, Lambadaris, Narayanan, Opatrny, Stacho, Urrutia, Yazdani (b27) 2010 Tan, Wu (b25) 2010 Chen, Wang, Wang (b32) 2011; 46 Liang, Zhang (b23) 2021; vol. 13153 Guo, Zou, Wu, Xu, Du (b18) 2021 Leiserson, Rivest, Cormen, Stein (b33) 2001 Bellazreg, Boudriga, An (b6) 2013 Li, Shen (b14) 2019; 163 Li (10.1016/j.comnet.2023.109717_b14) 2019; 163 Leiserson (10.1016/j.comnet.2023.109717_b33) 2001 Cardei (10.1016/j.comnet.2023.109717_b1) 2004; 21 Wang (10.1016/j.comnet.2023.109717_b2) 2006; 11 Sun (10.1016/j.comnet.2023.109717_b5) 2011; 9 Kumar (10.1016/j.comnet.2023.109717_b11) 2005 Chenait (10.1016/j.comnet.2023.109717_b8) 2017; 127 Dobrev (10.1016/j.comnet.2023.109717_b13) 2015; 579 Tan (10.1016/j.comnet.2023.109717_b25) 2010 Zhang (10.1016/j.comnet.2023.109717_b29) 2017; 47 Czyzowicz (10.1016/j.comnet.2023.109717_b12) 2009 Zou (10.1016/j.comnet.2023.109717_b19) 2022; 34 Yao (10.1016/j.comnet.2023.109717_b15) 2021 Gao (10.1016/j.comnet.2023.109717_b17) 2017; 25 Mehrandish (10.1016/j.comnet.2023.109717_b26) 2011 Czyzowicz (10.1016/j.comnet.2023.109717_b27) 2010 Huang (10.1016/j.comnet.2023.109717_b21) 2021 Bellazreg (10.1016/j.comnet.2023.109717_b6) 2013 Wang (10.1016/j.comnet.2023.109717_b28) 2017; 112 Blum (10.1016/j.comnet.2023.109717_b34) 1973; 7 Eriskin (10.1016/j.comnet.2023.109717_b22) 2021; 198 Ghannadrezaii (10.1016/j.comnet.2023.109717_b10) 2019; 160 Bhattacharya (10.1016/j.comnet.2023.109717_b24) 2008; 410 Liang (10.1016/j.comnet.2023.109717_b23) 2021; vol. 13153 Chen (10.1016/j.comnet.2023.109717_b3) 2013; 50 Li (10.1016/j.comnet.2023.109717_b4) 2015 Chen (10.1016/j.comnet.2023.109717_b32) 2011; 46 Shi (10.1016/j.comnet.2023.109717_b9) 2020; 175 Guo (10.1016/j.comnet.2023.109717_b18) 2021 Ali (10.1016/j.comnet.2023.109717_b7) 2016; 12 Zhang (10.1016/j.comnet.2023.109717_b30) 2018; 36 Mei (10.1016/j.comnet.2023.109717_b20) 2022 Yao (10.1016/j.comnet.2023.109717_b16) 2021 Zhang (10.1016/j.comnet.2023.109717_b31) 2018; 26 Balister (10.1016/j.comnet.2023.109717_b35) 2016; 49 |
| References_xml | – start-page: 159 year: 2021 end-page: 166 ident: b15 article-title: Improved fast algorithms for optimal min-max line barrier coverage with mobile sensors on the plane publication-title: 24th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2021, Alicante, Spain, November 22 - 26, 2021 – volume: 49 start-page: 429 year: 2016 end-page: 478 ident: b35 article-title: Barrier coverage publication-title: Random Struct. Algorithms – volume: vol. 13153 start-page: 3 year: 2021 end-page: 14 ident: b23 article-title: Constant-approximation for prize-collecting min-sensor sweep coverage with base stations publication-title: Algorithmic Aspects in Information and Management - 15th International Conference, AAIM 2021, Virtual Event, December 20-22, 2021, Proceedings – volume: 36 start-page: 1 year: 2018 end-page: 24 ident: b30 article-title: Minimizing the total cost of barrier coverage in a linear domain publication-title: J. Comb. Optim. – volume: 163 year: 2019 ident: b14 article-title: Minimizing maximum movement of sensors for line barrier coverage in the plane publication-title: Comput. Netw. – start-page: 1132 year: 2021 end-page: 1133 ident: b16 article-title: Poster: Quadratic-time algorithms for optimal min-max barrier coverage with mobile sensors on the plane publication-title: 41th IEEE International Conference on Distributed Computing Systems, ICDCS 2021, Washington DC, USA, July 7-10, 2021 – start-page: 696 year: 2021 end-page: 706 ident: b18 article-title: MinSum movement of barrier and target coverage using sink-based mobile sensors on the plane publication-title: 41th IEEE International Conference on Distributed Computing Systems, ICDCS 2021, Washington DC, USA, July 7-10, 2021 – start-page: 840 year: 2021 end-page: 859 ident: b21 article-title: PTAS for minimum cost multi-covering with disks publication-title: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021 – volume: 198 year: 2021 ident: b22 article-title: Point coverage with heterogeneous sensor networks: A robust optimization approach under target location uncertainty publication-title: Comput. Netw. – start-page: 653 year: 2011 end-page: 658 ident: b26 article-title: Minimizing the number of sensors moved on line barriers publication-title: 2011 IEEE Wireless Communications and Networking Conference – volume: 112 start-page: 314 year: 2017 end-page: 328 ident: b28 article-title: Achieving location error tolerant barrier coverage for wireless sensor networks publication-title: Comput. Netw. – volume: 50 start-page: 374 year: 2013 end-page: 408 ident: b3 article-title: Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain publication-title: Discret. Comput. Geom. – volume: 34 year: 2022 ident: b19 article-title: Linear time algorithm for computing min-max movement of sink-based mobile sensors for line barrier coverage publication-title: Concurr. Comput. Pract. Exp. – start-page: 244 year: 2015 end-page: 252 ident: b4 article-title: Minimizing the maximum sensor movement for barrier coverage in the plane publication-title: 2015 IEEE Conference on Computer Communications – start-page: 29 year: 2010 end-page: 42 ident: b27 article-title: On minimizing the sum of sensor movements for barrier coverage of a line segment publication-title: International Conference on Ad-Hoc Networks and Wireless – volume: 26 start-page: 2404 year: 2018 end-page: 2413 ident: b31 article-title: Breach-free sleep-wakeup scheduling for barrier coverage with heterogeneous wireless sensors publication-title: IEEE/ACM Trans. Netw. – volume: 21 start-page: 201 year: 2004 end-page: 202 ident: b1 article-title: Coverage in wireless sensor networks publication-title: Handbook of Sensor Networks – volume: 410 start-page: 5515 year: 2008 end-page: 5528 ident: b24 article-title: Optimal movement of mobile sensors for barrier coverage of a planar region publication-title: Theoret. Comput. Sci. – volume: 175 year: 2020 ident: b9 article-title: QoS-aware UAV coverage path planning in 5G mmwave network publication-title: Comput. Netw. – year: 2001 ident: b33 article-title: Introduction to Algorithms, Vol. 6 – start-page: 221 year: 2013 end-page: 226 ident: b6 article-title: Border surveillance using sensor based thick-lines publication-title: The International Conference on Information Networking 2013, ICOIN 2013, Bangkok, Thailand, January 28-30, 2013 – volume: 25 start-page: 3616 year: 2017 end-page: 3627 ident: b17 article-title: Energy efficient algorithms for publication-title: IEEE/ACM Trans. Netw. – volume: 46 start-page: 334 year: 2011 end-page: 360 ident: b32 article-title: Representing a functional curve by curves with fewer peaks publication-title: Discret. Comput. Geom. – volume: 160 start-page: 1 year: 2019 end-page: 10 ident: b10 article-title: Maximizing network coverage in a multichannel short-range underwater acoustic sensor network publication-title: Comput. Netw. – start-page: 327 year: 2010 end-page: 338 ident: b25 article-title: New algorithms for barrier coverage with mobile sensors publication-title: International Workshop on Frontiers in Algorithmics – volume: 9 start-page: 468 year: 2011 end-page: 477 ident: b5 article-title: BorderSense: Border patrol through advanced wireless sensor networks publication-title: Ad Hoc Netw. – start-page: 194 year: 2009 end-page: 212 ident: b12 article-title: On minimizing the maximum sensor movement for barrier coverage of a line segment publication-title: International Conference on Ad-Hoc Networks and Wireless – start-page: 284 year: 2005 end-page: 298 ident: b11 article-title: Barrier coverage with wireless sensors publication-title: Proceedings of the 11th Annual International Conference on Mobile Computing and Networking – year: 2022 ident: b20 article-title: Min-max movement of barrier coverage with sink-based mobile sensors for crowdsensing publication-title: Pervasive Mob. Comput. – volume: 11 start-page: 291 year: 2006 end-page: 304 ident: b2 article-title: Efficient point coverage in wireless sensor networks publication-title: J. Comb. Optim. – volume: 579 start-page: 64 year: 2015 end-page: 73 ident: b13 article-title: Complexity of barrier coverage with relocatable sensors in the plane publication-title: Theoret. Comput. Sci. – volume: 47 start-page: 3854 year: 2017 end-page: 3865 ident: b29 article-title: Problem specific MOEA/D for barrier coverage with wireless sensors publication-title: IEEE Trans. Cybern. – volume: 127 start-page: 1 year: 2017 end-page: 12 ident: b8 article-title: Energy-efficient coverage protocol based on stable and predictive scheduling in wireless sensor networks publication-title: Comput. Netw. – volume: 12 start-page: 778 year: 2016 end-page: 789 ident: b7 article-title: SimpliMote: A wireless sensor network monitoring platform for oil and gas pipelines publication-title: IEEE Syst. J. – volume: 7 start-page: 448 year: 1973 end-page: 461 ident: b34 article-title: Time bounds for selection publication-title: J. Comput. System Sci. – start-page: 244 year: 2015 ident: 10.1016/j.comnet.2023.109717_b4 article-title: Minimizing the maximum sensor movement for barrier coverage in the plane – issn: 1574-1192 year: 2022 ident: 10.1016/j.comnet.2023.109717_b20 article-title: Min-max movement of barrier coverage with sink-based mobile sensors for crowdsensing publication-title: Pervasive Mob. Comput. doi: 10.1016/j.pmcj.2022.101653 – volume: 36 start-page: 1 issue: 2 year: 2018 ident: 10.1016/j.comnet.2023.109717_b30 article-title: Minimizing the total cost of barrier coverage in a linear domain publication-title: J. Comb. Optim. doi: 10.1007/s10878-018-0306-6 – start-page: 159 year: 2021 ident: 10.1016/j.comnet.2023.109717_b15 article-title: Improved fast algorithms for optimal min-max line barrier coverage with mobile sensors on the plane – volume: 7 start-page: 448 issue: 4 year: 1973 ident: 10.1016/j.comnet.2023.109717_b34 article-title: Time bounds for selection publication-title: J. Comput. System Sci. doi: 10.1016/S0022-0000(73)80033-9 – volume: 50 start-page: 374 issue: 2 year: 2013 ident: 10.1016/j.comnet.2023.109717_b3 article-title: Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain publication-title: Discret. Comput. Geom. doi: 10.1007/s00454-013-9525-x – start-page: 221 year: 2013 ident: 10.1016/j.comnet.2023.109717_b6 article-title: Border surveillance using sensor based thick-lines – volume: 9 start-page: 468 issue: 3 year: 2011 ident: 10.1016/j.comnet.2023.109717_b5 article-title: BorderSense: Border patrol through advanced wireless sensor networks publication-title: Ad Hoc Netw. doi: 10.1016/j.adhoc.2010.09.008 – volume: 410 start-page: 5515 issue: 52 year: 2008 ident: 10.1016/j.comnet.2023.109717_b24 article-title: Optimal movement of mobile sensors for barrier coverage of a planar region publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2009.07.007 – start-page: 653 year: 2011 ident: 10.1016/j.comnet.2023.109717_b26 article-title: Minimizing the number of sensors moved on line barriers – volume: 34 issue: 2 year: 2022 ident: 10.1016/j.comnet.2023.109717_b19 article-title: Linear time algorithm for computing min-max movement of sink-based mobile sensors for line barrier coverage publication-title: Concurr. Comput. Pract. Exp. doi: 10.1002/cpe.6175 – volume: 12 start-page: 778 issue: 1 year: 2016 ident: 10.1016/j.comnet.2023.109717_b7 article-title: SimpliMote: A wireless sensor network monitoring platform for oil and gas pipelines publication-title: IEEE Syst. J. doi: 10.1109/JSYST.2016.2597171 – start-page: 696 year: 2021 ident: 10.1016/j.comnet.2023.109717_b18 article-title: MinSum movement of barrier and target coverage using sink-based mobile sensors on the plane – volume: 49 start-page: 429 issue: 3 year: 2016 ident: 10.1016/j.comnet.2023.109717_b35 article-title: Barrier coverage publication-title: Random Struct. Algorithms doi: 10.1002/rsa.20656 – start-page: 29 year: 2010 ident: 10.1016/j.comnet.2023.109717_b27 article-title: On minimizing the sum of sensor movements for barrier coverage of a line segment – volume: 160 start-page: 1 year: 2019 ident: 10.1016/j.comnet.2023.109717_b10 article-title: Maximizing network coverage in a multichannel short-range underwater acoustic sensor network publication-title: Comput. Netw. doi: 10.1016/j.comnet.2019.05.011 – volume: vol. 13153 start-page: 3 year: 2021 ident: 10.1016/j.comnet.2023.109717_b23 article-title: Constant-approximation for prize-collecting min-sensor sweep coverage with base stations – volume: 47 start-page: 3854 issue: 11 year: 2017 ident: 10.1016/j.comnet.2023.109717_b29 article-title: Problem specific MOEA/D for barrier coverage with wireless sensors publication-title: IEEE Trans. Cybern. – start-page: 327 year: 2010 ident: 10.1016/j.comnet.2023.109717_b25 article-title: New algorithms for barrier coverage with mobile sensors – volume: 163 year: 2019 ident: 10.1016/j.comnet.2023.109717_b14 article-title: Minimizing maximum movement of sensors for line barrier coverage in the plane publication-title: Comput. Netw. doi: 10.1016/j.comnet.2019.06.019 – volume: 198 year: 2021 ident: 10.1016/j.comnet.2023.109717_b22 article-title: Point coverage with heterogeneous sensor networks: A robust optimization approach under target location uncertainty publication-title: Comput. Netw. doi: 10.1016/j.comnet.2021.108416 – volume: 127 start-page: 1 year: 2017 ident: 10.1016/j.comnet.2023.109717_b8 article-title: Energy-efficient coverage protocol based on stable and predictive scheduling in wireless sensor networks publication-title: Comput. Netw. doi: 10.1016/j.comnet.2017.07.015 – volume: 21 start-page: 201 year: 2004 ident: 10.1016/j.comnet.2023.109717_b1 article-title: Coverage in wireless sensor networks – start-page: 194 year: 2009 ident: 10.1016/j.comnet.2023.109717_b12 article-title: On minimizing the maximum sensor movement for barrier coverage of a line segment – volume: 25 start-page: 3616 issue: 6 year: 2017 ident: 10.1016/j.comnet.2023.109717_b17 article-title: Energy efficient algorithms for k-sink minimum movement target coverage problem in mobile sensor network publication-title: IEEE/ACM Trans. Netw. doi: 10.1109/TNET.2017.2756925 – volume: 26 start-page: 2404 issue: 5 year: 2018 ident: 10.1016/j.comnet.2023.109717_b31 article-title: Breach-free sleep-wakeup scheduling for barrier coverage with heterogeneous wireless sensors publication-title: IEEE/ACM Trans. Netw. doi: 10.1109/TNET.2018.2867156 – volume: 175 year: 2020 ident: 10.1016/j.comnet.2023.109717_b9 article-title: QoS-aware UAV coverage path planning in 5G mmwave network publication-title: Comput. Netw. doi: 10.1016/j.comnet.2020.107207 – volume: 579 start-page: 64 year: 2015 ident: 10.1016/j.comnet.2023.109717_b13 article-title: Complexity of barrier coverage with relocatable sensors in the plane publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2015.02.006 – year: 2001 ident: 10.1016/j.comnet.2023.109717_b33 – start-page: 1132 year: 2021 ident: 10.1016/j.comnet.2023.109717_b16 article-title: Poster: Quadratic-time algorithms for optimal min-max barrier coverage with mobile sensors on the plane – volume: 46 start-page: 334 issue: 2 year: 2011 ident: 10.1016/j.comnet.2023.109717_b32 article-title: Representing a functional curve by curves with fewer peaks publication-title: Discret. Comput. Geom. doi: 10.1007/s00454-011-9338-8 – volume: 112 start-page: 314 year: 2017 ident: 10.1016/j.comnet.2023.109717_b28 article-title: Achieving location error tolerant barrier coverage for wireless sensor networks publication-title: Comput. Netw. doi: 10.1016/j.comnet.2016.11.014 – volume: 11 start-page: 291 issue: 3 year: 2006 ident: 10.1016/j.comnet.2023.109717_b2 article-title: Efficient point coverage in wireless sensor networks publication-title: J. Comb. Optim. doi: 10.1007/s10878-006-7909-z – start-page: 284 year: 2005 ident: 10.1016/j.comnet.2023.109717_b11 article-title: Barrier coverage with wireless sensors – start-page: 840 year: 2021 ident: 10.1016/j.comnet.2023.109717_b21 article-title: PTAS for minimum cost multi-covering with disks |
| SSID | ssj0004428 |
| Score | 2.4023283 |
| Snippet | Emerging IoT applications impose line barrier coverage (LBC) tasks with min–max movement objective due to requirements of energy balance, fairness, etc. In... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 109717 |
| SubjectTerms | Approximation algorithm Barrier coverage Exact algorithm Mobile sensor Optimal solution |
| Title | Optimal algorithm for min-max line barrier coverage with mobile sensors on 2-dimensional plane |
| URI | https://dx.doi.org/10.1016/j.comnet.2023.109717 |
| Volume | 228 |
| WOSCitedRecordID | wos000981722700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-7069 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004428 issn: 1389-1286 databaseCode: AIEXJ dateStart: 19990114 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LbxMxELZCywEOiKcoBeQDt8ioeL1xfIyqIkBVQaKgcGHlZ9nS9VZpUvIT-NmMH5tNCUKAxGW1Gq3jjeeTPTM78w1Cz5xzzEjBiYHzmbAXlBMFbligEIXTmVKhIgPfx0N-dDSeTsW7weB7Vwtzeca9Hy-X4vy_qhpkoOxQOvsX6l79KAjgHpQOV1A7XP9I8W9hE2gCA8DZSQue_5cmZhI2tSeNXA6jVankLDaq0yF_MyTtxGhs0yrYIoYX4NiGDjwAC0pMIP9PxB2h4bS_ymyQO0IMfcoljwHcSROoF0zGWV9OnGMPQqzFHj7JNuUI16s0oEWUHLb-5Ouizxaq02P5lI2SVFNSy295cI5c0KLPsErhtI2SmrgDgwVF4NDM_NhJNubgBuylni7dtk1TUfnGEZCiEadBg_Dvn4eJI09nKhH9iVz7ffxOC7OBJwYDKb-GtikvBWzx25PXB9M3fY0ti316V6_XlWHGXMHNuX5t5qyZLse30a3sc-BJwsodNLD-Lrq5xkR5D33OqMEr1GBADc6owQE1OKMGd6jBATU4oQZn1ODW4yuowRE199GHlwfH-69Ibr1BNPiYc1IYWcKdZiNXOq2F1M5wrqyhRVEYB0ZMacDwL60ZWevClzxt95yTDASlsbJ4gLZ86-1DhJUZW3hAiZGWTBRSsEIbVirBmNLcmB1EupWqzhPDStWlHp5WaWWrsLJVWtkdxLvlrLKVmKy_ChDw25GP_nnkLrrRA_gx2prPFvYJuq4v5_XF7GmGyg-IA48f |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Optimal+algorithm+for+min-max+line+barrier+coverage+with+mobile+sensors+on+2-dimensional+plane&rft.jtitle=Computer+networks+%28Amsterdam%2C+Netherlands+%3A+1999%29&rft.au=Yao%2C+Pei&rft.au=Guo%2C+Longkun&rft.au=Li%2C+Peng&rft.au=Lin%2C+Jiawei&rft.date=2023-06-01&rft.pub=Elsevier+B.V&rft.issn=1389-1286&rft.eissn=1872-7069&rft.volume=228&rft_id=info:doi/10.1016%2Fj.comnet.2023.109717&rft.externalDocID=S1389128623001627 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1389-1286&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1389-1286&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1389-1286&client=summon |