{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:35Z","timestamp":1740099035528,"version":"3.37.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319780535"},{"type":"electronic","value":"9783319780542"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-78054-2_40","type":"book-chapter","created":{"date-parts":[[2018,3,22]],"date-time":"2018-03-22T05:01:34Z","timestamp":1521694894000},"page":"425-435","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Application of Local Search with\u00a0Perturbation Inspired by Cellular Automata for Heuristic Optimization of\u00a0Sensor Network Coverage Problem"],"prefix":"10.1007","author":[{"given":"Krzysztof","family":"Trojanowski","sequence":"first","affiliation":[]},{"given":"Artur","family":"Mikitiuk","sequence":"additional","affiliation":[]},{"given":"Krzysztof J. M.","family":"Napiorkowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,23]]},"reference":[{"issue":"1\u20133","key":"40_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2007.11.022","volume":"393","author":"S Bozapalidis","year":"2008","unstructured":"Bozapalidis, S., Kalampakas, A.: Graph automata. Theor. Comput. Sci 393(1\u20133), 147\u2013165 (2008). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2007.11.022","journal-title":"Theor. Comput. Sci"},{"issue":"3","key":"40_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1504\/IJSNET.2008.018487","volume":"3","author":"I Cardei","year":"2008","unstructured":"Cardei, I., Cardei, M.: Energy-efficient connected-coverage in wireless sensor networks. IJSNet 3(3), 201\u2013210 (2008). \nhttps:\/\/doi.org\/10.1504\/IJSNET.2008.018487","journal-title":"IJSNet"},{"issue":"8","key":"40_CR3","doi-asserted-by":"publisher","first-page":"2288","DOI":"10.1016\/j.adhoc.2013.04.017","volume":"11","author":"M Erdelj","year":"2013","unstructured":"Erdelj, M., Loscr\u00ec, V., Natalizio, E., Razafindralambo, T.: Multiple point of interest discovery and coverage with mobile wireless sensors. Ad Hoc Netw. 11(8), 2288\u20132300 (2013). \nhttps:\/\/doi.org\/10.1016\/j.adhoc.2013.04.017","journal-title":"Ad Hoc Netw."},{"issue":"12","key":"40_CR4","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/355588.365104","volume":"7","author":"JH Halton","year":"1964","unstructured":"Halton, J.H.: Algorithm 247: radical-inverse quasi-random point sequence. Commun. ACM 7(12), 701\u2013702 (1964). \nhttps:\/\/doi.org\/10.1145\/355588.365104","journal-title":"Commun. ACM"},{"key":"40_CR5","doi-asserted-by":"publisher","unstructured":"Tian, D., Georganas, N.D.: A coverage-preserving node scheduling scheme for large wireless sensor networks. In: Proceedings of the First ACM International Workshop on Wireless Sensor Networks and Applications (WSNA 2002), pp. 32\u201341. ACM Press (2002). \nhttps:\/\/doi.org\/10.1145\/570738.570744","DOI":"10.1145\/570738.570744"},{"key":"40_CR6","doi-asserted-by":"publisher","unstructured":"Tretyakova, A., Seredynski, F.: Application of evolutionary algorithms to maximum lifetime coverage problem in wireless sensor networks. In: IPDPS Workshops, pp. 445\u2013453. IEEE (2013). \nhttps:\/\/doi.org\/10.1109\/IPDPSW.2013.96","DOI":"10.1109\/IPDPSW.2013.96"},{"key":"40_CR7","unstructured":"Tretyakova, A., Seredynski, F.: Simulated annealing application to maximum lifetime coverage problem in wireless sensor networks. In: Global Conference on Artificial Intelligence, GCAI, vol. 36, pp. 296\u2013311. EasyChair (2015)"},{"issue":"2","key":"40_CR8","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1177\/0037549715612579","volume":"92","author":"A Tretyakova","year":"2016","unstructured":"Tretyakova, A., Seredynski, F., Bouvry, P.: Graph cellular automata approach to the maximum lifetime coverage problem in wireless sensor networks. Simulation 92(2), 153\u2013164 (2016). \nhttps:\/\/doi.org\/10.1177\/0037549715612579","journal-title":"Simulation"},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/S0019-9958(79)90288-2","volume":"42","author":"AY Wu","year":"1979","unstructured":"Wu, A.Y., Rosenfeld, A.: Cellular graph automata I and II. Inf. Control 42, 305\u2013353 (1979). \nhttps:\/\/doi.org\/10.1016\/S0019-9958(79)90288-2","journal-title":"Inf. Control"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78054-2_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,22]],"date-time":"2018-03-22T05:17:43Z","timestamp":1521695863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-78054-2_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319780535","9783319780542"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78054-2_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}