{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T05:58:51Z","timestamp":1768024731994,"version":"3.49.0"},"reference-count":62,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T00:00:00Z","timestamp":1628553600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["CNS-1850851, OAC-1725755, OAC-2104078, and SCC-1952045"],"award-info":[{"award-number":["CNS-1850851, OAC-1725755, OAC-2104078, and SCC-1952045"]}]},{"name":"Polish National Science Center","award":["2019\/33\/B\/ST6\/02988"],"award-info":[{"award-number":["2019\/33\/B\/ST6\/02988"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Sen. Netw."],"published-print":{"date-parts":[[2021,11,30]]},"abstract":"<jats:p>\n            This article deals with reliable and unreliable mobile sensors having identical sensing radius\n            <jats:italic>r<\/jats:italic>\n            , communication radius\n            <jats:italic>R<\/jats:italic>\n            , provided that\n            <jats:italic>r<\/jats:italic>\n            \u2264\n            <jats:italic>R<\/jats:italic>\n            and initially randomly deployed\n            <jats:italic>on the plane<\/jats:italic>\n            by dropping them from an aircraft according to general random process. The sensors have to move from their initial random positions to the final destinations to provide greedy path\n            <jats:italic>k<\/jats:italic>\n            <jats:sub>1<\/jats:sub>\n            -coverage simultaneously with\n            <jats:italic>k<\/jats:italic>\n            <jats:sub>2<\/jats:sub>\n            -connectivity. In particular, we are interested in assigning the sensing radius\n            <jats:italic>r<\/jats:italic>\n            and communication radius\n            <jats:italic>R<\/jats:italic>\n            to minimize\n            <jats:italic>the time required<\/jats:italic>\n            and\n            <jats:italic>the energy consumption<\/jats:italic>\n            of transportation cost for sensors to provide the desired\n            <jats:italic>k<\/jats:italic>\n            <jats:sub>1<\/jats:sub>\n            -coverage with\n            <jats:italic>k<\/jats:italic>\n            <jats:sub>2<\/jats:sub>\n            -connectivity. We prove that for both of these optimization problems, the optimal solution is to assign the sensing radius equal to\n            <jats:italic>r<\/jats:italic>\n            =\n            <jats:italic>k<\/jats:italic>\n            <jats:sub>1<\/jats:sub>\n            ||\n            <jats:bold>E<\/jats:bold>\n            [S]||\/2 and the communication radius\n            <jats:italic>R<\/jats:italic>\n            =\n            <jats:italic>k<\/jats:italic>\n            <jats:sub>2<\/jats:sub>\n            ||\n            <jats:bold>E<\/jats:bold>\n            [S]||\/2, where ||\n            <jats:bold>E<\/jats:bold>\n            [S]|| is the characteristic of general random process according to which the sensors are deployed. When\n            <jats:italic>r<\/jats:italic>\n            &lt;\n            <jats:italic>k<\/jats:italic>\n            <jats:sub>1<\/jats:sub>\n            ||\n            <jats:bold>E<\/jats:bold>\n            [S]||\/2 or\n            <jats:italic>R<\/jats:italic>\n            &lt;\n            <jats:italic>k<\/jats:italic>\n            <jats:sub>2<\/jats:sub>\n            ||\n            <jats:bold>E<\/jats:bold>\n            [S]||\/ 2, and sensors are reliable, we discover and explain\n            <jats:italic>the sharp increase<\/jats:italic>\n            in the time required and the energy consumption in transportation cost to ensure the desired\n            <jats:italic>k<\/jats:italic>\n            <jats:sub>1<\/jats:sub>\n            -coverage with\n            <jats:italic>k<\/jats:italic>\n            <jats:sub>2<\/jats:sub>\n            -connectivity.\n          <\/jats:p>","DOI":"10.1145\/3457408","type":"journal-article","created":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T17:15:45Z","timestamp":1628615745000},"page":"1-48","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["On the Range Assignment in Wireless Sensor Networks for Minimizing the Coverage-Connectivity Cost"],"prefix":"10.1145","volume":"17","author":[{"given":"Sajal K.","family":"Das","sequence":"first","affiliation":[{"name":"Department of Computer Science, Missouri University of Science and Technology, Rolla, MO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5847-8259","authenticated-orcid":false,"given":"Rafa\u0142","family":"Kapelko","sequence":"additional","affiliation":[{"name":"Department of Fundamentals of Computer Science, Wroc\u0142aw University of Science and Technology, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,8,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.246"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2017.2758344"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2822894"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.146"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1462187.1462189"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2009.166"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.82"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882966"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.07.007"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2018.07.003"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921621.1921629"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.04.027"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2014.2366106"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1464420.1464425"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-019-00611-7"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.spl.2018.03.016"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/JCN.2019.000005"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2489253.2489268"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/140968094"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.11650\/tjm\/200503"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2756925"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2815630"},{"key":"e_1_2_1_23_1","unstructured":"X. Gao J. Fan F. Wu and G. Chen. 2020. Cooperative sweep coverage problem with mobile sensors. IEEE Trans. Mobile Comput. (2020) 1\u20131.  X. Gao J. Fan F. Wu and G. Chen. 2020. Cooperative sweep coverage problem with mobile sensors. IEEE Trans. Mobile Comput. (2020) 1\u20131."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3085577"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2008.02.001"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/562056"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2015.08.004"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2015.2488646"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2012.07.004"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2019.2901802"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2017.1322092"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1080\/03610926.2017.1406114"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154273.3154330"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2018.10.006"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/LSENS.2018.2877385"},{"key":"e_1_2_1_36_1","volume-title":"Asymptotic formula for sum of moment mean deviation for order statistics from uniform distribution. Discr. Math. Algor. Appl. 11 (Apr","author":"Kapelko R.","year":"2019","unstructured":"R. Kapelko . 2019. Asymptotic formula for sum of moment mean deviation for order statistics from uniform distribution. Discr. Math. Algor. Appl. 11 (Apr . 2019 ), 1\u201323. R. Kapelko. 2019. Asymptotic formula for sum of moment mean deviation for order statistics from uniform distribution. Discr. Math. Algor. Appl. 11 (Apr. 2019), 1\u201323."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3369740.3369768"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2016.01.002"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2016.06.004"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2017.01.010"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.07.019"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-006-9856-0"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/3006048.3006140"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2983130"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/1076315"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2017.06.010"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/557945"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3325512"},{"key":"e_1_2_1_49_1","volume-title":"Proceedings of the IEEE International Conference on Computer Communications (INFOCOM\u201909)","author":"Saipulla A.","unstructured":"A. Saipulla , C. Westphal , B. Liu , and J. Wang . 2009. Barrier coverage of line-based deployed wireless sensor networks . In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM\u201909) . IEEE, 127\u2013135. A. Saipulla, C. Westphal, B. Liu, and J. Wang. 2009. Barrier coverage of line-based deployed wireless sensor networks. In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM\u201909). IEEE, 127\u2013135."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2012.02.004"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2004.02.001"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3352486"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2020.109118"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1080\/17442508808833503"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2015.08.005"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.spl.2011.08.017"},{"key":"e_1_2_1_57_1","doi-asserted-by":"crossref","unstructured":"W. Wu Z. Zhang W. Lee and D. Du. 2020. Optimal Coverage in Wireless Sensor Networks. Springer Cham.  W. Wu Z. Zhang W. Lee and D. Du. 2020. Optimal Coverage in Wireless Sensor Networks. Springer Cham.","DOI":"10.1007\/978-3-030-52824-9"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1077391.1077394"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2007.05.003"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2017.2681692"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2018.12.001"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/1464420.1464428"}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3457408","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3457408","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3457408","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:07Z","timestamp":1750195687000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3457408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,10]]},"references-count":62,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,11,30]]}},"alternative-id":["10.1145\/3457408"],"URL":"https:\/\/doi.org\/10.1145\/3457408","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"value":"1550-4859","type":"print"},{"value":"1550-4867","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,10]]},"assertion":[{"value":"2020-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-08-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}