{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:23Z","timestamp":1759637543424},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,11,28]],"date-time":"2013-11-28T00:00:00Z","timestamp":1385596800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s00453-013-9853-5","type":"journal-article","created":{"date-parts":[[2013,11,27]],"date-time":"2013-11-27T17:36:37Z","timestamp":1385573797000},"page":"148-166","source":"Crossref","is-referenced-by-count":8,"title":["Average Case Network Lifetime on an Interval with Adjustable Sensing Ranges"],"prefix":"10.1007","volume":"72","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[]},{"given":"Ben","family":"Baumer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,11,28]]},"reference":[{"key":"9853_CR1","first-page":"449","volume-title":"Proceedings of the 22nd ACM Symposium on Computational Geometry","author":"H. Alt","year":"2006","unstructured":"Alt, H., Arkin, E.M., Br\u00f6nnimann, H., Erickson, J., Fekete, S.P., Knauer, C., Lenchner, J., Mitchell, J.S.B., Whittlesey, K.: Minimum-cost coverage of point sets by disks. In: Proceedings of the 22nd ACM Symposium on Computational Geometry, pp.\u00a0449\u2013458 (2006)"},{"key":"9853_CR2","first-page":"28","volume-title":"Proceedings from the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities","author":"A. Bar-Noy","year":"2011","unstructured":"Bar-Noy, A., Baumer, B.: Maximizing network lifetime on the line with adjustable sensing ranges. In: Proceedings from the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, pp.\u00a028\u201341 (2011)"},{"key":"9853_CR3","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/978-3-642-31104-8_4","volume-title":"Proceedings from the 19th International Colloquium on 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: Proceedings from the 19th International Colloquium on Structural Information and Communication Complexity, pp.\u00a036\u201347 (2012)"},{"key":"9853_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 (2012). Arxiv preprint arXiv:1204.1082v1","DOI":"10.1145\/2486159.2486162"},{"key":"9853_CR5","first-page":"71","volume-title":"Ad Hoc and Sensor Networks, Wireless Networks and Mobile Computing","author":"P. Berman","year":"2005","unstructured":"Berman, P., Calinescu, G., Shah, C., Zelikovsky, A.: Efficient energy management in sensor networks. In: Ad Hoc and Sensor Networks, Wireless Networks and Mobile Computing, vol. 2, pp.\u00a071\u201390 (2005)"},{"key":"9853_CR6","first-page":"460","volume-title":"Proceedings from the 13th Annual European Symposium on Algorithms","author":"V. Bil\u00f2","year":"2005","unstructured":"Bil\u00f2, V., Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Geometric clustering to minimize the sum of cluster sizes. In: Proceedings from the 13th Annual European Symposium on Algorithms, pp.\u00a0460\u2013471 (2005)"},{"key":"9853_CR7","first-page":"1056","volume-title":"Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"A.L. Buchsbaum","year":"2007","unstructured":"Buchsbaum, A.L., Efrat, A., Jain, S., Venkatasubramanian, S., Yi, K.: Restricted strip covering and the sensor cover problem. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a01056\u20131063 (2007)"},{"issue":"3","key":"9853_CR8","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s11276-005-6615-6","volume":"11","author":"M. Cardei","year":"2005","unstructured":"Cardei, M., Du, D.Z.: Improving wireless sensor network lifetime through power aware organization. Wirel. Netw. 11(3), 333\u2013340 (2005)","journal-title":"Wirel. Netw."},{"key":"9853_CR9","first-page":"432","volume-title":"Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems","author":"M. Cardei","year":"2004","unstructured":"Cardei, M., Wu, J.: Coverage in wireless sensor networks. In: Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems, pp.\u00a0432\u2013446. CRC Press, Boca Raton (2004), Chap.\u00a019"},{"issue":"1\/2","key":"9853_CR10","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1504\/IJSNET.2006.010833","volume":"1","author":"M. Cardei","year":"2006","unstructured":"Cardei, M., Wu, J., Lu, M.: Improving network lifetime using sensors with adjustable sensing ranges. Int. J. Sens. Netw. 1(1\/2), 41\u201349 (2006)","journal-title":"Int. J. Sens. Netw."},{"key":"9853_CR11","first-page":"438","volume-title":"Proceedings from the 3rd IEEE International Conference on Wireless and Mobile Computing, Networking and Communications","author":"M. Cardei","year":"2005","unstructured":"Cardei, M., Wu, J., Lu, M., Pervaiz, M.O.: Maximum network lifetime in wireless sensor networks with adjustable sensing ranges. In: Proceedings from the 3rd IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, pp.\u00a0438\u2013445 (2005)"},{"key":"9853_CR12","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/978-3-642-22300-6_16","volume-title":"Proceedings from the 12th International Symposium on Algorithms and Data Structures","author":"E.W. Chambers","year":"2011","unstructured":"Chambers, E.W., Fekete, S.P., Hoffmann, H.F., Marinakis, D., Mitchell, J.S.B., Srinivasan, V., Stege, U., Whitesides, S.: Connecting a set of circles with minimum sum of radii. In: Proceedings from the 12th International Symposium on Algorithms and Data Structures, pp.\u00a0183\u2013194 (2011)"},{"issue":"4","key":"9853_CR13","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1080\/17445760902720008","volume":"24","author":"A. Dhawan","year":"2009","unstructured":"Dhawan, A., Prasad, S.K.: A distributed algorithmic framework for coverage problems in wireless sensor networks. Int. J. Parallel Emerg. Distrib. Syst. 24(4), 331\u2013348 (2009)","journal-title":"Int. J. Parallel Emerg. Distrib. Syst."},{"issue":"1","key":"9853_CR14","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1137\/100798144","volume":"41","author":"M. Gibson","year":"2012","unstructured":"Gibson, M., Kanade, G., Krohn, E., Pirwani, I.A., Varadarajan, K.R.: On clustering to minimize the sum of radii. SIAM J. Comput. 41(1), 47\u201360 (2012)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9853_CR15","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s00454-011-9353-9","volume":"46","author":"M. Gibson","year":"2011","unstructured":"Gibson, M., Varadarajan, K.R.: Optimally decomposing coverings with translates of a convex polygon. Discrete Comput. Geom. 46(2), 313\u2013333 (2011)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"9853_CR16","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/j.comnet.2004.08.012","volume":"47","author":"N. Lev-Tov","year":"2005","unstructured":"Lev-Tov, N., Peleg, D.: Polynomial time approximation schemes for base station coverage with minimum total radii. Comput. Netw. 47(4), 489\u2013501 (2005)","journal-title":"Comput. Netw."},{"key":"9853_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing\u2014Randomized Algorithms and Probabilistic Analysis","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing\u2014Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"9853_CR18","first-page":"1","volume-title":"Proceedings from the 8th IEEE International Conference on Distributed Computing in Sensor Systems","author":"B. Phelan","year":"2012","unstructured":"Phelan, B., Terlecky, P., Bar-Noy, A., Brown, T., Rawitz, D.: Should I stay or should I go? Maximizing lifetime with relays. In: Proceedings from the 8th IEEE International Conference on Distributed Computing in Sensor Systems, pp.\u00a01\u20138 (2012)"},{"key":"9853_CR19","first-page":"127","volume-title":"Proceedings from the 28th IEEE International Conference on Computer Communications","author":"A. Saipulla","year":"2009","unstructured":"Saipulla, A., Westphal, C., Liu, B., Wang, J.: Barrier coverage of line-based deployed wireless sensor networks. In: Proceedings from the 28th IEEE International Conference on Computer Communications, pp.\u00a0127\u2013135 (2009)"},{"issue":"3\/4","key":"9853_CR20","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1504\/IJSNET.2011.040239","volume":"9","author":"Y. Taniguchi","year":"2011","unstructured":"Taniguchi, Y., Kitani, T., Leibnitz, K.: A uniform airdrop deployment method for large-scale wireless sensor networks. Int. J. Sens. Netw. 9(3\/4), 182\u2013191 (2011)","journal-title":"Int. J. Sens. Netw."},{"issue":"5","key":"9853_CR21","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1007\/s11036-006-7798-5","volume":"11","author":"L. Wang","year":"2006","unstructured":"Wang, L., Xiao, Y.: A survey of energy-efficient scheduling mechanisms in sensor networks. Mob. Netw. Appl. 11(5), 723\u2013740 (2006)","journal-title":"Mob. Netw. Appl."},{"key":"9853_CR22","unstructured":"Weisstein, E.W.: q-series. From MathWorld\u2014A Wolfram Web Resource. http:\/\/mathworld.wolfram.com\/q-Series.html"},{"issue":"1","key":"9853_CR23","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1142\/S0129054105002838","volume":"16","author":"J. Wu","year":"2005","unstructured":"Wu, J., Yang, S.: Energy-efficient node scheduling models in sensor networks with adjustable ranges. Int. J. Found. Comput. Sci. 16(1), 3\u201317 (2005)","journal-title":"Int. J. Found. Comput. Sci."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9853-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9853-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9853-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,17]],"date-time":"2022-03-17T21:16:48Z","timestamp":1647551808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9853-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,28]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["9853"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9853-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,28]]}}}