{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:34Z","timestamp":1725488974062},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_39","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"430-441","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults"],"prefix":"10.1007","author":[{"given":"Andrea E. F.","family":"Clementi","sequence":"first","affiliation":[]},{"given":"Angelo","family":"Monti","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Pasquale","sequence":"additional","affiliation":[]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Adler, M., Scheideler, C.: Efficient communication strategies for ad hoc wireless networks. In: Proc. of 10th ACM SPAA, pp. 259\u2013268 (1998)","DOI":"10.1145\/277651.277692"},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/0022-0000(91)90015-W","volume":"43","author":"N. Alon","year":"1991","unstructured":"Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. Journal of Computer and System Science\u00a043, 290\u2013298 (1991)","journal-title":"Journal of Computer and System Science"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Berenbrink, P., Brinkmann, A., Scheideler, C.: Simple routing strategies for adversarial systems. In: Proc. of 42th IEEE FOCS, pp. 158\u2013167 (2001)","DOI":"10.1109\/SFCS.2001.959890"},{"key":"39_CR4","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","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. Journal of Computer and System Science\u00a045, 104\u2013126 (1992)","journal-title":"Journal of Computer and System Science"},{"issue":"4","key":"39_CR5","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":"39_CR6","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1093\/comjnl\/bxl018","volume":"49","author":"T. Calamoneri","year":"2006","unstructured":"Calamoneri, T.: The L(h,k)-Labeling problem: Survey and Annotated Bibliography. The Computer Journal\u00a049, 585\u2013608 (2006)","journal-title":"The Computer Journal"},{"key":"39_CR7","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 Life Time 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":"39_CR8","unstructured":"Chlebus, B., Gasieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. In: Proc. of 11th ACM-SIAM SODA, pp. 861\u2013870 (2000)"},{"issue":"2","key":"39_CR9","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. Journal of Algorithms\u00a043(2), 177\u2013189 (2002)","journal-title":"Journal of Algorithms"},{"key":"39_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B.N. Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics\u00a086, 165\u2013177 (1990)","journal-title":"Discrete Mathematics"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Crescenzi, P., Penna, P., Vocca, P.: On the complexity of minimum energy consumption broadcast subgraphs. In: Proc of 11th STACS, pp. 121\u2013131 (2001)","DOI":"10.1007\/3-540-44693-1_11"},{"key":"39_CR12","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. Theoretical Computer Science\u00a0302, 337\u2013364 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"39_CR13","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.jpdc.2003.09.002","volume":"64","author":"A.E.F. Clementi","year":"2004","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Round Robin is optimal for fault-tolerant broadcasting on wireless networks. Journal of Parallel and Distributed Computing\u00a064(1), 89\u201396 (2004)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"39_CR14","unstructured":"Clementi, A.E.F., Monti, A., Pasquale, F., Silvestri, R.: Optimal gossiping in directed geometric radio networks in presence of dynamical faults (2007), available at www.mat.uniroma2.it\/~pasquale"},{"key":"39_CR15","first-page":"125","volume":"9","author":"A.E.F. Clementi","year":"2004","unstructured":"Clementi, A.E.F., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. MONET\u00a0(9), 125\u2013140 (2004)","journal-title":"MONET"},{"issue":"2","key":"39_CR16","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. Journal of Algorithms\u00a060(2), 115\u2013143 (2006)","journal-title":"Journal of Algorithms"},{"key":"39_CR17","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.jda.2006.07.001","volume":"5","author":"A. Dessmark","year":"2007","unstructured":"Dessmark, A., Pelc, A.: Broadcasting in geometric radio networks. Journal of Discrete Algorithms\u00a05, 187\u2013201 (2007)","journal-title":"Journal of Discrete Algorithms"},{"key":"39_CR18","unstructured":"Ephremides, A., Nguyen, G., Wieselthier, J.: On the construction of energy-efficient broadcast and multi-cast trees in wireless networks. In: Proc. of 19th IEEE INFOCOM, pp. 585\u2013594 (2000)"},{"key":"39_CR19","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0020-0190(01)00312-X","volume":"2","author":"L. Gasieniec","year":"2002","unstructured":"Gasieniec, L., Lingas, A.: On adaptive deterministic gossiping in ad-hoc radio networks. Information Processing Letters\u00a02, 89\u201393 (2002)","journal-title":"Information Processing Letters"},{"key":"39_CR20","doi-asserted-by":"crossref","unstructured":"Gasieniec, L., Peleg, D., Xin, Q.: Faster Communication in Known Topology Radio Networks. In: Proc. of 24th ACM PODC, pp. 129\u2013137 (2005)","DOI":"10.1145\/1073814.1073840"},{"key":"39_CR21","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Deterministic Superimposed Coding with Application to Pattern Matching. In: Proc. of 38th IEEE FOCS, pp. 127\u2013136 (1997)","DOI":"10.1109\/SFCS.1997.646101"},{"key":"39_CR22","unstructured":"Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: Proc of 13th ACM-SIAM SODA, pp. 697\u2013704 (2002)"},{"key":"39_CR23","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(98)00223-0","volume":"243","author":"L. Kirousis","year":"2000","unstructured":"Kirousis, L., 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":"39_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/3-540-68530-8_24","volume-title":"Algorithms - ESA \u201998","author":"E. Kranakis","year":"1998","unstructured":"Kranakis, E., Krizanc, D., Pelc, A.: Fault-Tolerant Broadcasting in Radio Networks. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 283\u2013294. Springer, Heidelberg (1998)"},{"key":"39_CR25","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1002\/0471224561.ch24","volume-title":"Handbook of Wireless Networks and Mobile Computing","author":"A. Pelc","year":"2002","unstructured":"Pelc, A.: Broadcasting in radio networks. In: Handbook of Wireless Networks and Mobile Computing, pp. 509\u2013528. John Wiley and Sons, Inc., Chichester (2002)"},{"key":"39_CR26","doi-asserted-by":"crossref","unstructured":"Pelc, A., Peleg, D.: Feasibility and complexity of broadcasting with random transmission failures. In: Proc. of 24th ACM PODC, pp. 334\u2013341 (2005)","DOI":"10.1145\/1073814.1073879"},{"key":"39_CR27","doi-asserted-by":"crossref","unstructured":"Pagani, E., Rossi, G.: Reliable Broadcast in Mobile Multihop Packet Networks. In: Proc. of 3rd ACM-IEEE MOBICOM, pp. 34\u201342 (1997)","DOI":"10.1145\/262116.262125"},{"key":"39_CR28","volume-title":"Wireless Communications: Principles and Practice","author":"T.S. Rappaport","year":"1996","unstructured":"Rappaport, T.S.: Wireless Communications: Principles and Practice. Prentice-Hall, Englewood Cliffs (1996)"},{"key":"39_CR29","unstructured":"Sen, A., Malesinska, E.: On Approximation algorithms for packet radio scheduling. In: Proc. of 35th Allerton Conference on Communication, Control and Computing, Allerton, pp. 573\u2013582 (1997)"},{"key":"39_CR30","doi-asserted-by":"crossref","unstructured":"Scheideler, C.: Models and Techniques for Communication in Dynamic Networks. In: Proc. of 18th STACS, pp. 27\u201349 (2001)","DOI":"10.1007\/3-540-45841-7_2"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:29:06Z","timestamp":1619519346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}