{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:23Z","timestamp":1759638803086,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642336508"},{"type":"electronic","value":"9783642336515"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33651-5_4","type":"book-chapter","created":{"date-parts":[[2012,11,13]],"date-time":"2012-11-13T09:25:32Z","timestamp":1352798732000},"page":"46-60","source":"Crossref","is-referenced-by-count":7,"title":["Collecting Information by Power-Aware Mobile Agents"],"prefix":"10.1007","author":[{"given":"Julian","family":"Anaya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00e9mie","family":"Chalopin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jurek","family":"Czyzowicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Labourel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yann","family":"Vax\u00e8s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"4_CR1","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/1735223.1735245","volume":"53","author":"S. Albers","year":"2010","unstructured":"Albers, S.: Energy-efficient algorithms. Comm. ACM\u00a053(5), 86\u201396 (2010)","journal-title":"Comm. ACM"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM J. on Comput. 29(4),1164\u20131188","DOI":"10.1137\/S009753979732428X"},{"key":"4_CR3","unstructured":"Alpern, S., Gal, S.: The theory of search games and rendezvous. Kluwer Academic Publ. (2002)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1007\/11523468_92","volume-title":"Automata, Languages and Programming","author":"C. Amb\u00fchl","year":"2005","unstructured":"Amb\u00fchl, C.: An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1139\u20131150. Springer, Heidelberg (2005)"},{"issue":"5","key":"4_CR5","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/70.795787","volume":"15","author":"H. Ando","year":"1999","unstructured":"Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Trans. on Robotics and Automation\u00a015(5), 818\u2013828 (1999)","journal-title":"IEEE Trans. on Robotics and Automation"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: Distributed Computing, pp. 235\u2013253 (2006)","DOI":"10.1007\/s00446-005-0138-3"},{"key":"4_CR7","first-page":"1942","volume":"3","author":"V. Annamalai","year":"2003","unstructured":"Annamalai, V., Gupta, S.K.S., Schwiebert, L.: On Tree-Based Convergecasting in Wireless Sensor Networks. IEEE Wireless Communications and Networking 3, 1942\u20131947 (2003)","journal-title":"IEEE Wireless Communications and Networking"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"1499","DOI":"10.1137\/05063787X","volume":"37","author":"J. Augustine","year":"2008","unstructured":"Augustine, J., Irani, S., Swamy, C.: Optimal powerdown strategies. SIAM J. Comput.\u00a037, 1499\u20131516 (2008)","journal-title":"SIAM J. Comput."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0166-218X(95)00054-U","volume":"68","author":"I. Averbakh","year":"1996","unstructured":"Averbakh, I., Berman, O.: A heuristic with worst-case analysis for minimax routing of two traveling salesmen on a tree. Discrete Applied Mathematics\u00a068, 17\u201332 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/BFb0029569","volume-title":"Online Algorithms","author":"Y. Azar","year":"1998","unstructured":"Azar, Y.: On-line Load Balancing. In: Fiat, A., Woeginger, G. (eds.) Online Algorithms 1996. LNCS, vol.\u00a01442, pp. 178\u2013195. Springer, Heidelberg (1998)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1006\/inco.1999.2795","volume":"152","author":"B. Awerbuch","year":"1999","unstructured":"Awerbuch, B., Betke, M., Rivest, R., Singh, M.: Piecemeal graph exploration by a mobile robot. Information and Computation\u00a0152, 155\u2013172 (1999)","journal-title":"Information and Computation"},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R.A. Baeza Yates","year":"1993","unstructured":"Baeza Yates, R.A., Culberson, J.C., Rawlins, G.J.E.: Searching in the Plane. Information and Computation\u00a0106(2), 234\u2013252 (1993)","journal-title":"Information and Computation"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Bender, M., Fernandez, A., Ron, D., Sahai, A., Vadhan, S.: The power of a pebble: exploring and mapping directed graphs. In: Proc. 30th STOC, pp. 269\u2013278 (1998)","DOI":"10.1145\/276698.276759"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Bender, M., Slonim, D.: The power of team exploration: two robots can learn unlabeled directed graphs. In: Proc. 35th FOCS, pp. 75\u201385 (1994)","DOI":"10.1109\/SFCS.1994.365703"},{"issue":"2\/3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1023\/A:1022803514157","volume":"18","author":"M. Betke","year":"1995","unstructured":"Betke, M., Rivest, R.L., Singh, M.: Piecemeal learning of an unknown environment. Machine Learning\u00a018(2\/3), 231\u2013254 (1995)","journal-title":"Machine Learning"},{"issue":"1","key":"4_CR16","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1137\/S0097539791194931","volume":"26","author":"A. Blum","year":"1997","unstructured":"Blum, A., Raghavan, P., Schieber, B.: Navigating in unfamiliar geometric terrain. SIAM J. Comput.\u00a026(1), 110\u2013137 (1997)","journal-title":"SIAM J. Comput."},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Bunde, D.P.: Power-aware scheduling for makespan and flow. In: SPAA, pp. 190\u2013196 (2006)","DOI":"10.1145\/1148109.1148140"},{"issue":"1","key":"4_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/TMC.2011.26","volume":"11","author":"F. Chen","year":"2012","unstructured":"Chen, F., Johnson, M.P., Alayev, Y., Bar-Noy, A., La Porta, T.F.: Who, When, Where: Timeslot Assignment to Mobile Clients. IEEE Transactions on Mobile Computing\u00a011(1), 73\u201385 (2012)","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1007\/3-540-45061-0_90","volume-title":"Automata, Languages and Programming","author":"M. Cieliebak","year":"2003","unstructured":"Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Solving the Robots Gathering Problem. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 1181\u20131196. Springer, Heidelberg (2003)"},{"issue":"6","key":"4_CR20","doi-asserted-by":"publisher","first-page":"1516","DOI":"10.1137\/S0097539704446475","volume":"34","author":"R. Cohen","year":"2005","unstructured":"Cohen, R., Peleg, D.: Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems. SIAM J. on Comput.\u00a034(6), 1516\u20131528 (2005)","journal-title":"SIAM J. on Comput."},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1007\/978-3-642-22012-8_52","volume-title":"Automata, Languages and Programming","author":"A. Cord-Landwehr","year":"2011","unstructured":"Cord-Landwehr, A., Degener, B., Fischer, M., H\u00fcllmann, M., Kempkes, B., Klaas, A., Kling, P., Kurras, S., M\u00e4rtens, M., Meyer auf der Heide, F., Raupach, C., Swierkot, K., Warner, D., Weddemann, C., Wonisch, D.: A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 650\u2013661. Springer, Heidelberg (2011)"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Deng, X., Papadimitriou, C.H.: Exploring an unknown graph. In: Proc. 31st FOCS, vol.\u00a0I, pp. 355\u2013361 (1990)","DOI":"10.1109\/FSCS.1990.89554"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Das, S., Flocchini, P., Santoro, N., Yamashita, M.: On the Computational Power of Oblivious Robots: Forming a Series of Geometric Patterns. In: Proc. PODC, pp. 267\u2013276 (2010)","DOI":"10.1145\/1835698.1835761"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/11682127_24","volume-title":"Architecture of Computing Systems - ARCS 2006","author":"M. Dynia","year":"2006","unstructured":"Dynia, M., Korzeniowski, M., Schindelhauer, C.: Power-Aware Collective Tree Exploration. In: Grass, W., Sick, B., Waldschmidt, K. (eds.) ARCS 2006. LNCS, vol.\u00a03894, pp. 341\u2013351. Springer, Heidelberg (2006)"},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2005.01.001","volume":"337","author":"P. Flocchini","year":"2005","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Th. Comp. Science\u00a0337, 147\u2013168 (2005)","journal-title":"Th. Comp. Science"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-24698-5_18","volume-title":"LATIN 2004: Theoretical Informatics","author":"P. Fraigniaud","year":"2004","unstructured":"Fraigniaud, P., G\u0105sieniec, L., Kowalski, D.R., Pelc, A.: Collective Tree Exploration. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 141\u2013151. Springer, Heidelberg (2004)"},{"key":"4_CR27","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness, 96\u2013105, 224 (1979)"},{"key":"4_CR28","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"G. Frederickson","year":"1978","unstructured":"Frederickson, G., Hecht, M., Kim, C.: Approximation algorithms for some routing problems. SIAM J. on Comput.\u00a07, 178\u2013193 (1978)","journal-title":"SIAM J. on Comput."},{"issue":"4","key":"4_CR29","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1109\/TWC.2002.804190","volume":"1","author":"W.B. Heinzelman","year":"2002","unstructured":"Heinzelman, W.B., Chandrakasan, A.P., Balakrishnan, H.: An Application-Specific Protocol Architecture for Wireless Microsensor Networks. Transactions on Wireless Communication\u00a01(4), 660\u2013670 (2002)","journal-title":"Transactions on Wireless Communication"},{"issue":"4","key":"4_CR30","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/1290672.1290678","volume":"3","author":"S. Irani","year":"2007","unstructured":"Irani, S., Shukla, S.K., Gupta, R.: Algorithms for power savings. ACM Trans. on Algorithms\u00a03(4), Article 41 (2007)","journal-title":"ACM Trans. on Algorithms"},{"issue":"4","key":"4_CR31","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1016\/j.jpdc.2005.11.004","volume":"66","author":"A. Kesselman","year":"2006","unstructured":"Kesselman, A., Kowalski, D.R.: Fast distributed algorithm for convergecast in ad hoc geometric radio networks. Journal of Parallel and Distributed Computing\u00a066(4), 578\u2013585 (2006)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Krishnamachari, L., Estrin, D., Wicker, S.: The impact of data aggregation in wireless sensor networks. In: ICDCS Workshops, pp. 575\u2013578 (2002)","DOI":"10.1109\/ICDCSW.2002.1030829"},{"key":"4_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-642-22012-8_38","volume-title":"Automata, Languages and Programming","author":"N. Megow","year":"2011","unstructured":"Megow, N., Mehlhorn, K., Schweitzer, P.: Online Graph Exploration: New Results on Old and New Algorithms. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 478\u2013489. Springer, Heidelberg (2011)"},{"key":"4_CR34","doi-asserted-by":"publisher","first-page":"121","DOI":"10.3390\/a2010121","volume":"2","author":"S. Nikoletseas","year":"2009","unstructured":"Nikoletseas, S., Spirakis, P.G.: Distributed Algorithms for Energy Efficient Routing and Tracking in Wireless Sensor Networks. Algorithms\u00a02, 121\u2013157 (2009)","journal-title":"Algorithms"},{"issue":"4","key":"4_CR35","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/COMST.2006.283821","volume":"8","author":"R. Rajagopalan","year":"2006","unstructured":"Rajagopalan, R., Varshney, P.K.: Data-aggregation techniques in sensor networks: a survey. IEEE Communications Surveys and Tutorials\u00a08(4), 48\u201363 (2006)","journal-title":"IEEE Communications Surveys and Tutorials"},{"issue":"11","key":"4_CR36","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1109\/71.969123","volume":"12","author":"I. Stojmenovic","year":"2001","unstructured":"Stojmenovic, I., Lin, X.: Power-Aware Localized Routing in Wireless Networks. IEEE Trans. Parallel Distrib. Syst.\u00a012(11), 1122\u20131133 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"4","key":"4_CR37","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1137\/S009753979628292X","volume":"28","author":"I. Suzuki","year":"1999","unstructured":"Suzuki, I., Yamashita, M.: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. SIAM J. Comput.\u00a028(4), 1347\u20131363 (1999)","journal-title":"SIAM J. Comput."},{"issue":"26-28","key":"4_CR38","doi-asserted-by":"publisher","first-page":"2433","DOI":"10.1016\/j.tcs.2010.01.037","volume":"411","author":"M. Yamashita","year":"2010","unstructured":"Yamashita, M., Suzuki, I.: Characterizing geometric patterns formable by oblivious anonymous mobile robots. Th. Comp. Science\u00a0411(26-28), 2433\u20132453 (2010)","journal-title":"Th. Comp. Science"},{"key":"4_CR39","unstructured":"Yao, F.F., Demers, A.J., Shenker, S.: A scheduling model for reduced CPU energy. In: Proc. of 36th FOCS, pp. 374\u2013382 (1995)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33651-5_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T19:21:24Z","timestamp":1745176884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33651-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642336508","9783642336515"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33651-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}