{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T10:37:56Z","timestamp":1779359876579,"version":"3.51.4"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2022,12,20]],"date-time":"2022-12-20T00:00:00Z","timestamp":1671494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61972199, 61931011 and 62072254"],"award-info":[{"award-number":["61972199, 61931011 and 62072254"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100013058","name":"Jiangsu Provincial Key Research and Development Program","doi-asserted-by":"crossref","award":["BE2021013-4"],"award-info":[{"award-number":["BE2021013-4"]}],"id":[{"id":"10.13039\/501100013058","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Sen. Netw."],"published-print":{"date-parts":[[2023,5,31]]},"abstract":"<jats:p>To control the rapid spread of COVID-19, we consider deploying a set of Unmanned Aerial Vehicles (UAVs) to form a quarantine barrier such that anyone crossing the barrier can be detected. We use a charging pile to recharge UAVs. The problem is scheduling UAVs to cover the barrier, and, for any scheduling strategy, estimating the minimum number of UAVs needed to cover the barrier forever. We propose breaking the barrier into subsegments so that each subsegment can be monitored by a single UAV. We then analyze two scheduling strategies, where the first one is simple to implement and the second one requires fewer UAVs. The first strategy divides UAVs into groups with each group covering a subsegment. For this strategy, we derive a closed-form formula for the minimum number of UAVs. In the case of insufficient UAVs, we give a recursive function to compute the exact coverage time and give a dynamic-programming algorithm to allocate UAVs to subsegments to maximize the overall coverage time. The second strategy schedules all UAVs dynamically. We prove a lower and an upper bound on the minimum number of UAVs. We implement a prototype system to verify the proposed coverage model and perform simulations to investigate the performance.<\/jats:p>","DOI":"10.1145\/3561303","type":"journal-article","created":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T11:48:07Z","timestamp":1662032887000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Deploying the Minimum Number of Rechargeable UAVs for a Quarantine Barrier"],"prefix":"10.1145","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0931-2927","authenticated-orcid":false,"given":"Xiaojun","family":"Zhu","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9949-3292","authenticated-orcid":false,"given":"Zhouqing","family":"Han","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9261-5210","authenticated-orcid":false,"given":"Shaojie","family":"Tang","sequence":"additional","affiliation":[{"name":"Naveen Jindal School of Management, University of Texas at Dallas, Richardson, Texas"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5796-5071","authenticated-orcid":false,"given":"Lijie","family":"Xu","sequence":"additional","affiliation":[{"name":"Jiangsu Key Laboratory of Big Data Security &amp; Intelligent Processing, Nanjing University of Posts and Telecommunications, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0183-0087","authenticated-orcid":false,"given":"Chao","family":"Dong","sequence":"additional","affiliation":[{"name":"College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,12,20]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCIT.2017.8261200"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41562-020-0931-9"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-019-00491-1"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1101\/2020.04.03.20052720"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-019-01010-4"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-020-75640-2"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2018.8377077"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41591-020-1036-8"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/MSN50589.2020.00076"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS51040.2020.00046"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2016.7842039"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.2999083"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2943147"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2019.2927425"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2019.8824918"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/ET.2019.8878586"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.010.2000528"},{"key":"e_1_3_1_19_2","unstructured":"RaspberryPi. 2021. Raspberry Pi Documentation-Basic Camera Usage. Retrieved Apri 22 2021 from https:\/\/www.raspberrypi.org\/documentation\/accessories\/camera.html."},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2012.2198665"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2020.3003311"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2914203"},{"key":"e_1_3_1_23_2","unstructured":"Wikipedia. 2021. Constant-recursive Sequence. Retrieved Apri 22 2021 from https:\/\/en.wikipedia.org\/wiki\/Constant-recursive_sequence."},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2020.2969220"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/IWCMC48107.2020.9148519"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2019.8761497"},{"key":"e_1_3_1_27_2","article-title":"Joint optimization of area coverage and mobile edge computing with clustering for FANETs","author":"You Wenjing","year":"2020","unstructured":"Wenjing You, Chao Dong, Xiao Cheng, Xiaojun Zhu, Qihui Wu, and Guihai Chen. 2020. Joint optimization of area coverage and mobile edge computing with clustering for FANETs. IEEE Internet of Things Journal 8, 2 (2020), 695\u2013707.","journal-title":"IEEE Internet of Things Journal"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2688328"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2611512"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2867156"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2895831"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2020.1011"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2022.3161080"}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3561303","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3561303","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:35Z","timestamp":1750186835000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3561303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,20]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,5,31]]}},"alternative-id":["10.1145\/3561303"],"URL":"https:\/\/doi.org\/10.1145\/3561303","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"value":"1550-4859","type":"print"},{"value":"1550-4867","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,20]]},"assertion":[{"value":"2021-12-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-08-29","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-12-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}