{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:46Z","timestamp":1750221286965,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,1,4]],"date-time":"2018-01-04T00:00:00Z","timestamp":1515024000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,1,4]]},"DOI":"10.1145\/3154273.3154330","type":"proceedings-article","created":{"date-parts":[[2018,1,12]],"date-time":"2018-01-12T13:49:57Z","timestamp":1515764997000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Maximum Movement of Random Sensors for Coverage and Interference on a Line"],"prefix":"10.1145","author":[{"given":"Rafa\u0142","family":"Kapelko","sequence":"first","affiliation":[{"name":"Department of Computer Science, Wroc\u0142aw University of Science and Technology, Wroc\u0142aw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,1,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1287853.1287863"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.07.007"},{"volume-title":"Probability and Measure","author":"Billingsley P.","key":"e_1_3_2_1_3_1","unstructured":"P. Billingsley . 2012. Probability and Measure . Wiley . P. Billingsley. 2012. Probability and Measure. Wiley."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/989459.989462"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31155-0_16"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Y. S. Chow and H. Teicher. 1997. Probability Theory Independence Interchange-ability Martingales. Springer.  Y. S. Chow and H. Teicher. 1997. Probability Theory Independence Interchange-ability Martingales. Springer.","DOI":"10.1007\/978-1-4612-1950-7"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04383-3_15"},{"volume-title":"Proceedings of ADHOC-NOW, LNCS v. 6288","author":"Czyzowicz J.","key":"e_1_3_2_1_8_1","unstructured":"J. Czyzowicz , E. Kranakis , D. Krizanc , I. Lambadaris , L. Narayanan , J. Opatrny , L. Stacho , J. Urrutia , and M. Yazdani . 2010. On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment . In Proceedings of ADHOC-NOW, LNCS v. 6288 . 29--42. J. Czyzowicz, E. Kranakis, D. Krizanc, I. Lambadaris, L. Narayanan, J. Opatrny, L. Stacho, J. Urrutia, and M. Yazdani. 2010. On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment. In Proceedings of ADHOC-NOW, LNCS v. 6288. 29--42."},{"volume-title":"Algorithms and Complexity: 10th International Conference, CIAC 2017, LNCS v. 10236","author":"Dobrev S.","key":"e_1_3_2_1_9_1","unstructured":"S. Dobrev , E. Kranakis , D. Krizanc , M. Lafond , J. Ma\u0148uch , L. Narayanan , J. Opatrny , S. Shende , and L. Stacho . 2017. Weak Coverage of a Rectangular Barrier . In Algorithms and Complexity: 10th International Conference, CIAC 2017, LNCS v. 10236 . 196--208. S. Dobrev, E. Kranakis, D. Krizanc, M. Lafond, J. Ma\u0148uch, L. Narayanan, J. Opatrny, S. Shende, and L. Stacho. 2017. Weak Coverage of a Rectangular Barrier. In Algorithms and Complexity: 10th International Conference, CIAC 2017, LNCS v. 10236. 196--208."},{"key":"e_1_3_2_1_10_1","volume-title":"COCOON. LNCS","volume":"8591","author":"E.","unstructured":"Kranakis E. and Shaikhet G . 2014. Displacing Random Sensors to Avoid Interference . In COCOON. LNCS , Vol. 8591 . Springer, 501--512. Kranakis E. and Shaikhet G. 2014. Displacing Random Sensors to Avoid Interference. In COCOON. LNCS, Vol. 8591. Springer, 501--512."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484258"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/MASS.2013.85"},{"volume-title":"An Introduction to Probability Theory and its Applications","author":"Feller W.","key":"e_1_3_2_1_13_1","unstructured":"W. Feller . 1968. An Introduction to Probability Theory and its Applications . Vol. 1 . John Wiley , NY. W. Feller. 1968. An Introduction to Probability Theory and its Applications. Vol. 1. John Wiley, NY."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"C. Forbes M. Evans N. Hasting and B. Peacock. 2011. Statistical Distributions. Wiley.  C. Forbes M. Evans N. Hasting and B. Peacock. 2011. Statistical Distributions. Wiley.","DOI":"10.1002\/9780470627242"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.03.003"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-005-1769-9"},{"key":"e_1_3_2_1_18_1","volume-title":"On Asymptotics of Moment Distance Between Sensors and Anchor Points. arXiv 1606.06865","author":"Kapelko R.","year":"2016","unstructured":"R. Kapelko . 2016. On Asymptotics of Moment Distance Between Sensors and Anchor Points. arXiv 1606.06865 ( 2016 ). R. Kapelko. 2016. On Asymptotics of Moment Distance Between Sensors and Anchor Points. arXiv 1606.06865 (2016)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2016.01.002"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2016.06.004"},{"volume-title":"Poisson Process","author":"Kingman F.C.","key":"e_1_3_2_1_21_1","unstructured":"J. F.C. Kingman . 1992. Poisson Process . Vol. 3 . Oxford University Press . J.F.C. Kingman. 1992. Poisson Process. Vol. 3. Oxford University Press."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.07.019"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486171"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/jpr.2016.33"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080829.1080859"},{"volume-title":"Proceedings of IEEE WCNC'11","author":"Mehrandish M.","key":"e_1_3_2_1_26_1","unstructured":"M. Mehrandish , L. Narayanan , and J. Opatrny . 2011. Minimizing the Number of Sensors Moved on Line Barriers . In Proceedings of IEEE WCNC'11 . 1464--1469. M. Mehrandish, L. Narayanan, and J. Opatrny. 2011. Minimizing the Number of Sensors Moved on Line Barriers. In Proceedings of IEEE WCNC'11. 1464--1469."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080810.1080816"},{"volume-title":"Probability Models for Computer Science","author":"Ross S.M.","key":"e_1_3_2_1_28_1","unstructured":"S.M. Ross . 2002. Probability Models for Computer Science . Academic Press . S.M. Ross. 2002. Probability Models for Computer Science. Academic Press."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"A. Saipulla C. Westphal B. Liu and J. Wang. 2009. Barrier coverage of line-based deployed wireless sensor networks. In INFOCOM. IEEE 127--135.  A. Saipulla C. Westphal B. Liu and J. Wang. 2009. Barrier coverage of line-based deployed wireless sensor networks. In INFOCOM. IEEE 127--135.","DOI":"10.1109\/INFCOM.2009.5061914"},{"volume-title":"Proceedings of IEEE INFOCOM'10","author":"Yan G.","key":"e_1_3_2_1_30_1","unstructured":"G. Yan and D. Qiao . 2010. Multi-Round Sensor Deployment for Guaranteed Barrier Coverage . In Proceedings of IEEE INFOCOM'10 . 2462--2470. G. Yan and D. Qiao. 2010. Multi-Round Sensor Deployment for Guaranteed Barrier Coverage. In Proceedings of IEEE INFOCOM'10. 2462--2470."}],"event":{"name":"ICDCN '18: 19th International Conference on Distributed Computing and Networking","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing","SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Varanasi India","acronym":"ICDCN '18"},"container-title":["Proceedings of the 19th International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3154273.3154330","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3154273.3154330","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:26Z","timestamp":1750212686000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3154273.3154330"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,4]]},"references-count":30,"alternative-id":["10.1145\/3154273.3154330","10.1145\/3154273"],"URL":"https:\/\/doi.org\/10.1145\/3154273.3154330","relation":{},"subject":[],"published":{"date-parts":[[2018,1,4]]},"assertion":[{"value":"2018-01-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}