{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:38:00Z","timestamp":1725507480626},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770954"},{"type":"electronic","value":"9783540770961"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77096-1_18","type":"book-chapter","created":{"date-parts":[[2008,4,11]],"date-time":"2008-04-11T11:44:46Z","timestamp":1207914286000},"page":"247-259","source":"Crossref","is-referenced-by-count":0,"title":["Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks"],"prefix":"10.1007","author":[{"given":"Tiziana","family":"Calamoneri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Clementi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emanuele G.","family":"Fusco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1139","DOI":"10.1007\/11523468_92","volume-title":"Automata, Languages and Programming","author":"C. Ambuehl","year":"2005","unstructured":"Ambuehl, 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)"},{"key":"18_CR2","first-page":"104","volume":"45","author":"R. Bar-Yehuda","year":"1992","unstructured":"Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. JCSS\u00a045, 104\u2013126 (1992)","journal-title":"JCSS"},{"issue":"4","key":"18_CR3","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/0222055","volume":"22","author":"R. Bar-Yehuda","year":"1993","unstructured":"Bar-Yehuda, R., Israeli, A., Itai, A.: Multiple communication in multi-hop radio networks. SICOMP\u00a022(4), 875\u2013887 (1993)","journal-title":"SICOMP"},{"key":"18_CR4","unstructured":"Calinescu, G., Li, X.Y., Frieder, O., Wan, P.J.: Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks. In: Proc. of 20th IEEE INFOCOM, pp. 1162\u20131171 (April 2001)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/978-3-540-73420-8_40","volume-title":"ICALP 2007","author":"I. Caragiannis","year":"2007","unstructured":"Caragiannis, I., Flammini, M., Moscardelli, L.: An exponential improvement on the MST heuristic for the minimum energy broadcast problem. In: Arge, L., Gachin, C., Jurdzinshi, T., Taoledci, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 447\u2013458. Springer, Heidelberg (2007)"},{"key":"18_CR7","doi-asserted-by":"publisher","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 organization. Wireless Networks\u00a011, 333\u2013340 (2005)","journal-title":"Wireless Networks"},{"issue":"1\/2","key":"18_CR8","doi-asserted-by":"publisher","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. Sensor Networks\u00a01(1\/2), 41\u201349 (2006)","journal-title":"Int. J. Sensor Networks"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44693-1_11","volume-title":"STACS 2001","author":"A. Clementi","year":"2001","unstructured":"Clementi, A., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 121\u2013131. Springer, Heidelberg (2001), http:\/\/www.dia.unisa.it\/~penna"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Clementi, A., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.C.: On the Approximation Ratio of the MST-based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks. In: Proc. of IPDPS 2003, p. 222 (2003)","DOI":"10.1109\/IPDPS.2003.1213407"},{"issue":"1-3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0304-3975(02)00851-4","volume":"302","author":"A.E.F. Clementi","year":"2003","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Distributed broadcast in radio networks of unknown topology. Theor. Comput. Sci.\u00a0302(1-3), 337\u2013364 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"18_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0196-6774(02)00004-4","volume":"43","author":"M. Chrobak","year":"2002","unstructured":"Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. J. Algorithms\u00a043(2), 177\u2013189 (2002)","journal-title":"J. Algorithms"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/s11276-006-6528-z","volume":"12","author":"W. Chu","year":"2006","unstructured":"Chu, W., Colbourn, C.J., Syrotiuk, V.R.: The effects of synchronization on topology transparent scheduling. Wireless Networks\u00a012, 681\u2013690 (2006)","journal-title":"Wireless Networks"},{"issue":"2","key":"18_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.jalgor.2004.08.001","volume":"60","author":"A. Czumaj","year":"2006","unstructured":"Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. J. Algorithms\u00a060(2), 115\u2013143 (2006)","journal-title":"J. Algorithms"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Dessmark, A., Pelc, A.: Broadcasting in geometric radio networks. Journal of Discrete Algorithms (2006)","DOI":"10.1016\/j.jda.2006.07.001"},{"key":"18_CR16","unstructured":"Ephremides, A., Nguyen, G.D., Wieselthier, J.E.: On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. In: Proc. of 19th IEEE INFOCOM, pp. 585\u2013594 (2000)"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Flaxman, A.D., Frieze, A.M., Vera, J.C.: On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem. In: Proc. of the 37-th ACM STOC 2005, pp. 441\u2013449 (2005)","DOI":"10.1145\/1060590.1060656"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/11427186_4","volume-title":"Experimental and Efficient Algorithms","author":"M. Flammini","year":"2005","unstructured":"Flammini, M., Navarra, A., Perennes, S.: The Real Approximation Factor of the MST Heuristic for the Minimum Energy Broadcast. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 22\u201331. Springer, Heidelberg (2005)"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Gupta, P., Kumar, P.R.: Critical power for asymptotic connectivity in wireless networks. In: Stochastic Analysis, Control, Optimization and Applications, Birkhauser, Boston, MA, pp. 547\u2013566 (1999)","DOI":"10.1007\/978-1-4612-1784-8_33"},{"key":"18_CR20","unstructured":"Kang, I., Poovendran, R.: Maximizing network lifetime of wireless broadcast ad hoc networks. J. of ACM Mobile Networks and Applications\u00a0(6) (2005)"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(98)00223-0","volume":"243","author":"L.M. Kirousis","year":"2000","unstructured":"Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power Consumption in Packet Radio Networks. Theoretical Computer Science\u00a0243, 289\u2013305 (2000)","journal-title":"Theoretical Computer Science"},{"key":"18_CR22","volume-title":"Wireless Information Networks","author":"K. Pahlavan","year":"1995","unstructured":"Pahlavan, K., Levesque, A.: Wireless Information Networks. Wiley-Interscience, Chichester (1995)"},{"key":"18_CR23","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random Geometric Graphs","author":"M. Penrose","year":"2003","unstructured":"Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)"},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/TMC.2003.1195149","volume":"2","author":"P. Santi","year":"2003","unstructured":"Santi, P., Blough, D.M.: The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks. IEEE Trans. on Mobile Computing\u00a02, 25\u201339 (2003)","journal-title":"IEEE Trans. on Mobile Computing"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77096-1_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:00:06Z","timestamp":1619521206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77096-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540770954","9783540770961"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77096-1_18","relation":{},"subject":[]}}