{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:44Z","timestamp":1759638344829},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_9","type":"book-chapter","created":{"date-parts":[[2013,8,15]],"date-time":"2013-08-15T23:22:47Z","timestamp":1376608967000},"page":"97-108","source":"Crossref","is-referenced-by-count":11,"title":["Maximizing Barrier Coverage Lifetime with Mobile Sensors"],"prefix":"10.1007","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dror","family":"Rawitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Terlecky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1016\/j.cor.2008.02.013","volume":"36","author":"A. Agnetis","year":"2009","unstructured":"Agnetis, A., Grande, E., Mirchandani, P.B., Pacifici, A.: Covering a line segment with variable radius discs. Computers & OR\u00a036(5), 1423\u20131436 (2009)","journal-title":"Computers & OR"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-642-28209-6_4","volume-title":"Algorithms for Sensor Systems","author":"A. Bar-Noy","year":"2012","unstructured":"Bar-Noy, A., Baumer, B.: Maximizing network lifetime on the line with adjustable sensing ranges. In: Erlebach, T., Nikoletseas, S., Orponen, P. (eds.) ALGOSENSORS 2011. LNCS, vol.\u00a07111, pp. 28\u201341. Springer, Heidelberg (2012)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-31104-8_4","volume-title":"Structural Information and Communication Complexity","author":"A. Bar-Noy","year":"2012","unstructured":"Bar-Noy, A., Baumer, B., Rawitz, D.: Changing of the guards: Strip cover with duty cycling. In: Even, G., Halld\u00f3rsson, M.M. (eds.) SIROCCO 2012. LNCS, vol.\u00a07355, pp. 36\u201347. Springer, Heidelberg (2012)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Baumer, B., Rawitz, D.: Set it and forget it: Approximating the set once strip cover problem. Technical Report 1204.1082, CoRR (2012)","DOI":"10.1145\/2486159.2486162"},{"issue":"52","key":"9_CR5","doi-asserted-by":"publisher","first-page":"5515","DOI":"10.1016\/j.tcs.2009.07.007","volume":"410","author":"B.K. Bhattacharya","year":"2009","unstructured":"Bhattacharya, B.K., Burmester, M., Hu, Y., Kranakis, E., Shi, Q., Wiese, A.: Optimal movement of mobile sensors for barrier coverage of a planar region. Theor. Comput. Sci.\u00a0410(52), 5515\u20135528 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR6","unstructured":"Buchsbaum, A.L., Efrat, A., Jain, S., Venkatasubramanian, S., Yi, K.: Restricted strip covering and the sensor cover problem. In: SODA, pp. 1056\u20131063 (2007)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-31155-0_16","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"D.Z. Chen","year":"2012","unstructured":"Chen, D.Z., Gu, Y., Li, J., Wang, H.: Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol.\u00a07357, pp. 177\u2013188. Springer, Heidelberg (2012)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-04383-3_15","volume-title":"Ad-Hoc, Mobile and Wireless Networks","author":"J. Czyzowicz","year":"2009","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Lambadaris, I., Narayanan, L., Opatrny, J., Stacho, L., Urrutia, J., Yazdani, M.: On minimizing the maximum sensor movement for barrier coverage of a line segment. In: Ruiz, P.M., Garcia-Luna-Aceves, J.J. (eds.) ADHOC-NOW 2009. LNCS, vol.\u00a05793, pp. 194\u2013212. Springer, Heidelberg (2009)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-14785-2_3","volume-title":"Ad-Hoc, Mobile and Wireless Networks","author":"J. Czyzowicz","year":"2010","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Lambadaris, I., Narayanan, L., Opatrny, J., Stacho, L., Urrutia, J., Yazdani, M.: On minimizing the sum of sensor movements for barrier coverage of a line segment. In: Nikolaidis, I., Wu, K. (eds.) ADHOC-NOW 2010. LNCS, vol.\u00a06288, pp. 29\u201342. Springer, Heidelberg (2010)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Gibson, M., Varadarajan, K.: Decomposing coverings and the planar sensor cover problem. In: FOCS, pp. 159\u2013168 (2009)","DOI":"10.1109\/FOCS.2009.54"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-23490-3_3","volume-title":"Wireless Algorithms, Systems, and Applications","author":"M. Li","year":"2011","unstructured":"Li, M., Sun, X., Zhao, Y.: Minimum-cost linear coverage by sensors with adjustable ranges. In: Cheng, Y., Eun, D.Y., Qin, Z., Song, M., Xing, K. (eds.) WASA 2011. LNCS, vol.\u00a06843, pp. 25\u201335. Springer, Heidelberg (2011)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Mehrandish, M., Narayanan, L., Opatrny, J.: Minimizing the number of sensors moved on line barriers. In: WCNC, pp. 653\u2013658 (2011)","DOI":"10.1109\/WCNC.2011.5779210"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Phelan, B., Terlecky, P., Bar-Noy, A., Brown, T., Rawitz, D.: Should I stay or should I go? Maximizing lifetime with relays. In: 8th DCOSS, pp. 1\u20138 (2012)","DOI":"10.1109\/DCOSS.2012.24"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-14553-7_31","volume-title":"Frontiers in Algorithmics","author":"X. Tan","year":"2010","unstructured":"Tan, X., Wu, G.: New algorithms for barrier coverage with mobile sensors. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol.\u00a06213, pp. 327\u2013338. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T16:19:06Z","timestamp":1646324346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}