{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:03:36Z","timestamp":1725728616981},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392467"},{"type":"electronic","value":"9783642392474"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39247-4_3","type":"book-chapter","created":{"date-parts":[[2013,6,4]],"date-time":"2013-06-04T01:43:18Z","timestamp":1370310198000},"page":"26-37","source":"Crossref","is-referenced-by-count":1,"title":["Maximum Lifetime Broadcast in Mobile Sensor Networks"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Nunes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederico","family":"Barboza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fl\u00e1vio","family":"Assis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TPDS.2010.77","volume":"22","author":"T. Calamoneri","year":"2011","unstructured":"Calamoneri, T., Clementi, A., Fusco, E., Silvestri, R.: Maximizing the number of broadcast operations in random geometric ad hoc wireless networks. IEEE Trans. Parallel Distrib. Syst.\u00a022, 208\u2013216 (2011)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-39658-1_13","volume-title":"Algorithms - ESA 2003","author":"G. Calinescu","year":"2003","unstructured":"Calinescu, G., Kapoor, S., Olshevsky, A., Zelikovsky, A.: Network lifetime and power assignment in ad hoc wireless networks. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 114\u2013126. Springer, Heidelberg (2003)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-642-22450-8_27","volume-title":"Ad-hoc, Mobile, and Wireless Networks","author":"A. Casteigts","year":"2011","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. In: Frey, H., Li, X., Ruehrup, S. (eds.) ADHOC-NOW 2011. LNCS, vol.\u00a06811, pp. 346\u2013359. Springer, Heidelberg (2011)"},{"key":"3_CR4","unstructured":"Chang, J.-H., Tassiulas, L.: Energy conserving routing in wireless ad-hoc networks. In: IEEE INFOCOM, pp. 22\u201331 (2000)"},{"key":"3_CR5","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press (2009)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Dietrich, I., Dressler, F.: On the lifetime of wireless sensor networks. ACM Transactions on Sensor Networks\u00a05(1) (January 2009)","DOI":"10.1145\/1464420.1464425"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-540-85209-4_34","volume-title":"Ad-hoc, Mobile and Wireless Networks","author":"M. Elkin","year":"2008","unstructured":"Elkin, M., Lando, Y., Nutov, Z., Segal, M., Shpungin, H.: Novel algorithms for the network lifetime problem in wireless settings. In: Coudert, D., Simplot-Ryl, D., Stojmenovic, I. (eds.) ADHOC-NOW 2008. LNCS, vol.\u00a05198, pp. 425\u2013438. Springer, Heidelberg (2008)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s11276-010-0287-6","volume":"17","author":"M. Elkin","year":"2011","unstructured":"Elkin, M., Lando, Y., Nutov, Z., Segal, M., Shpungin, H.: Novel algorithms for the network lifetime problem in wireless settings. Wireless Networks\u00a017, 397\u2013410 (2011)","journal-title":"Wireless Networks"},{"key":"3_CR9","unstructured":"Distributed Computing\u00a0Group ETH. Sinalgo - simulator for network algorithms, \n                  \n                    http:\/\/disco.ethz.ch\/projects\/sinalgo\/"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/s11036-005-4445-5","volume":"10","author":"I. Kang","year":"2005","unstructured":"Kang, I., Poovendran, R.: Maximizing network lifetime of broadcasting over wireless stationary ad hoc networks. Mobile Networks and Applications\u00a010, 879\u2013896 (2005)","journal-title":"Mobile Networks and Applications"},{"key":"3_CR11","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 4th edn. Springer (2008)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-31638-8_2","volume-title":"Ad-hoc, Mobile, and Wireless Networks","author":"S.H. Lee","year":"2012","unstructured":"Lee, S.H., Radzik, T.: Improved approximation bounds for maximum lifetime problems in wireless ad-hoc network. In: Li, X.-Y., Papavassiliou, S., Ruehrup, S. (eds.) ADHOC-NOW 2012. LNCS, vol.\u00a07363, pp. 14\u201327. Springer, Heidelberg (2012)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Nunes, B., Barboza, F., Assis, F.: A localized algorithm for the maximum lifetime broadcast problem with asymmetric edge costs. In: Proc. of the 12th IEEE Int. Symp. on Network Computing and Applications, NCA (August 2012)","DOI":"10.1109\/NCA.2012.43"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-05434-1_6","volume-title":"Algorithmic Aspects of Wireless Sensor Networks","author":"Z. Nutov","year":"2009","unstructured":"Nutov, Z., Segal, M.: Improved approximation algorithms for maximum lifetime problems in wireless networks. In: Dolev, S. (ed.) ALGOSENSORS 2009. LNCS, vol.\u00a05804, pp. 41\u201351. Springer, Heidelberg (2009)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Orda, A., Yassour, B.-A.: Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas. In: Proc. of the 6th ACM Int. Symp. on Mobile Ad Hoc Networking and Computing, MobiHoc 2005, pp. 426\u2013437 (2005)","DOI":"10.1145\/1062689.1062742"},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1109\/JCN.2002.6596934","volume":"4","author":"J. Wu","year":"2002","unstructured":"Wu, J., Dai, F., Gao, M., Stojmenovic, I.: On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. IEEE\/KICS Journal of Communications and Networks\u00a04, 59\u201370 (2002)","journal-title":"IEEE\/KICS Journal of Communications and Networks"}],"container-title":["Lecture Notes in Computer Science","Ad-hoc, Mobile, and Wireless Network"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39247-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:47:04Z","timestamp":1558316824000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39247-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392467","9783642392474"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39247-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}