{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T18:04:33Z","timestamp":1767981873639,"version":"3.49.0"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T00:00:00Z","timestamp":1406505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee, Hong Kong","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Sen. Netw."],"published-print":{"date-parts":[[2014,11,7]]},"abstract":"<jats:p>\n            One of the most fundamental tasks of wireless sensor networks is to provide coverage of the deployment region. We study the coverage of a line interval with a set of wireless sensors with adjustable coverage ranges. Each coverage range of a sensor is an interval centered at that sensor whose length is decided by the power the sensor chooses. The objective is to find a range assignment with the minimum cost. There are two variants of the optimization problem. In the\n            <jats:italic>discrete<\/jats:italic>\n            variant, each sensor can only choose from a finite set of powers, whereas in the\n            <jats:italic>continuous<\/jats:italic>\n            variant, each sensor can choose power from a given interval. For the discrete variant of the problem, a polynomial-time exact algorithm is designed. For the continuous variant of the problem, NP-hardness of the problem is proved and followed by an ILP formulation. Then, constant-approximation algorithms are designed when the cost for all sensors is proportional to\n            <jats:italic>r<\/jats:italic>\n            <jats:sup>\u03ba<\/jats:sup>\n            for some constant \u03ba \u2265 1, where\n            <jats:italic>r<\/jats:italic>\n            is the covering radius corresponding to the chosen power. Specifically, if \u03ba = 1, we give a 1.25-approximation algorithm and a fully polynomial-time approximation scheme; if \u03ba &gt; 1, we give a 2-approximation algorithm. We also show that the approximation analyses are tight.\n          <\/jats:p>","DOI":"10.1145\/2629518","type":"journal-article","created":{"date-parts":[[2014,8,6]],"date-time":"2014-08-06T12:16:33Z","timestamp":1407327393000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Barrier Coverage by Sensors with Adjustable Ranges"],"prefix":"10.1145","volume":"11","author":[{"given":"Haosheng","family":"Fan","sequence":"first","affiliation":[{"name":"City University of Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minming","family":"Li","sequence":"additional","affiliation":[{"name":"City University of Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianwei","family":"Sun","sequence":"additional","affiliation":[{"name":"City University of Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng-Jun","family":"Wan","sequence":"additional","affiliation":[{"name":"Illinois Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingchao","family":"Zhao","sequence":"additional","affiliation":[{"name":"Caritas Institute of Higher Education, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,7,28]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984684"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_3"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28209-6_4"},{"key":"e_1_2_1_4_1","volume-title":"Technical Report 1204.1082, CoRR.","author":"Bar-Noy A.","year":"2012"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 21st Annual ESA Symposium. 97--108","author":"Bar-Noy A."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02570718"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:MONE.0000013622.63511.57"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the 18th International Conference on Algorithms and Computation. 644--655","author":"Carmi P."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-013-9525-x"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04383-3_15"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881991.1881994"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.11.015"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12450-1_13"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90075-S"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214106"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"J. Hou D. Yau C. Ma Y. Yang H. Zhang I. Hou N. Rao and M. Shankar. 2009. Coverage in wireless sensor networks. In Guide to Wireless Sensor Networks 47--49.  J. Hou D. Yau C. Ma Y. Yang H. Zhang I. Hou N. Rao and M. Shankar. 2009. Coverage in wireless sensor networks. In Guide to Wireless Sensor Networks 47--49.","DOI":"10.1007\/978-1-84882-218-4_3"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-008-9146-0"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033150.2033153"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC\u201911)","author":"Mehrandish M."},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the Canadian Conference on Computational Geometry.","author":"Narayanappa S."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2107502.2107517"},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the 31st Annual IEEE International Conference on Computer Communications (INFOCOM\u201912)","author":"Wan P.-J."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862092"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-006-7909-z"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2040191"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.06.022"}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2629518","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2629518","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:18Z","timestamp":1750230078000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2629518"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,28]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,11,7]]}},"alternative-id":["10.1145\/2629518"],"URL":"https:\/\/doi.org\/10.1145\/2629518","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"value":"1550-4859","type":"print"},{"value":"1550-4867","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,28]]},"assertion":[{"value":"2013-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-07-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}