{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T10:28:05Z","timestamp":1790418485503,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642354755","type":"print"},{"value":"9783642354762","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35476-2_8","type":"book-chapter","created":{"date-parts":[[2012,12,13]],"date-time":"2012-12-13T15:48:14Z","timestamp":1355413694000},"page":"106-120","source":"Crossref","is-referenced-by-count":11,"title":["Electing a Leader in Multi-hop Radio Networks"],"prefix":"10.1007","author":[{"given":"Bogdan S.","family":"Chlebus","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dariusz R.","family":"Kowalski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1137\/0220023","volume":"20","author":"Y. Afek","year":"1991","unstructured":"Afek, Y., Gafni, E.: Time and message bounds for election in synchronous and asynchronous complete networks. SIAM J. on Computing\u00a020(2), 376\u2013394 (1991)","journal-title":"SIAM J. on Computing"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics, 2nd edn. John Wiley (2004)","DOI":"10.1002\/0471478210"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B.: Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems. In: Proceedings of the 19th ACM Symposium on Theory of Computing, STOC, pp. 230\u2013240 (1987)","DOI":"10.1145\/28395.28421"},{"issue":"1","key":"8_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 Sciences\u00a045(1), 104\u2013126 (1992)","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Censor-Hillel, K., Gilbert, S., Kuhn, F., Lynch, N.A., Newport, C.C.: Structuring unreliable radio networks. In: Proceedings of the 30th ACM Symposium on Principles of Distributed Computing, PODC, pp. 79\u201388 (2011)","DOI":"10.1145\/1993806.1993818"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-642-22012-8_49","volume-title":"Automata, Languages and Programming","author":"B.S. Chlebus","year":"2011","unstructured":"Chlebus, B.S., Kowalski, D.R., Pelc, A., Rokicki, M.A.: Efficient Distributed Communication in Ad-Hoc Radio Networks. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 613\u2013624. Springer, Heidelberg (2011)"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/s00453-007-9123-5","volume":"54","author":"B.S. Chlebus","year":"2009","unstructured":"Chlebus, B.S., Kowalski, D.R., Radzik, T.: Many-to-many communication in radio networks. Algorithmica\u00a054(1), 118\u2013139 (2009)","journal-title":"Algorithmica"},{"issue":"1-3","key":"8_CR8","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 Sciences\u00a0302(1-3), 337\u2013364 (2003)","journal-title":"Theoretical Computer Sciences"},{"issue":"2","key":"8_CR9","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"},{"issue":"6","key":"8_CR10","doi-asserted-by":"publisher","first-page":"2162","DOI":"10.1137\/080733826","volume":"39","author":"G. Marco De","year":"2010","unstructured":"De Marco, G.: Distributed broadcast in unknown radio networks. SIAM Journal on Computing\u00a039(6), 2162\u20132175 (2010)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R.G. Gallager","year":"1983","unstructured":"Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and Systems\u00a05(1), 66\u201377 (1983)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1137\/S0097539794261118","volume":"27","author":"J.A. Garay","year":"1998","unstructured":"Garay, J.A., Kutten, S., Peleg, D.: A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM J. on Computing\u00a027(1), 302\u2013316 (1998)","journal-title":"SIAM J. on Computing"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-11476-2_2","volume-title":"Structural Information and Communication Complexity","author":"L. G\u0105sieniec","year":"2010","unstructured":"G\u0105sieniec, L.: On Efficient Gossiping in Radio Networks. In: Kutten, S., \u017derovnik, J. (eds.) SIROCCO 2009. LNCS, vol.\u00a05869, pp. 2\u201314. Springer, Heidelberg (2010)"},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s00453-006-1212-3","volume":"47","author":"L. G\u0105sieniec","year":"2007","unstructured":"G\u0105sieniec, L., Pagourtzis, A., Potapov, I., Radzik, T.: Deterministic communication in radio networks with large labels. Algorithmica\u00a047(1), 97\u2013117 (2007)","journal-title":"Algorithmica"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Jurdzi\u0144ski, T., Kuty\u0142owski, M., Zatopia\u0144ski, J.: Efficient algorithms for leader election in radio networks. In: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing, PODC, pp. 51\u201357 (2002)","DOI":"10.1145\/571831.571833"},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00446-005-0126-7","volume":"18","author":"D.R. Kowalski","year":"2005","unstructured":"Kowalski, D.R., Pelc, A.: Broadcasting in undirected ad hoc radio networks. Distributed Computing\u00a018(1), 43\u201357 (2005)","journal-title":"Distributed Computing"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/978-3-642-02930-1_43","volume-title":"Automata, Languages and Programming","author":"D.R. Kowalski","year":"2009","unstructured":"Kowalski, D.R., Pelc, A.: Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol.\u00a05556, pp. 521\u2013533. Springer, Heidelberg (2009)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N.A., Newport, C.C., Oshman, R., Richa, A.W.: Broadcasting in unreliable radio networks. In: Proceedings of the 29th ACM Symposium on Principles of Distributed Computing, PODC, pp. 336\u2013345 (2010)","DOI":"10.1145\/1835698.1835779"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N.A., Oshman, R.: Distributed computation in dynamic networks. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC, pp. 513\u2013522 (2010)","DOI":"10.1145\/1806689.1806760"},{"issue":"3","key":"8_CR20","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1137\/S0097539794279109","volume":"27","author":"E. Kushilevitz","year":"1998","unstructured":"Kushilevitz, E., Mansour, Y.: An \u03a9(D log(N\/D)) lower bound for broadcast in radio networks. SIAM Journal on Computing\u00a027(3), 702\u2013712 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"8_CR21","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(94)90133-3","volume":"52","author":"C.U. Martel","year":"1994","unstructured":"Martel, C.U.: Maximum finding on a multiple access broadcast network. Information Processing Letters\u00a052(1), 7\u201315 (1994)","journal-title":"Information Processing Letters"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Nakano, K., Olariu, S.: A survey on leader election protocols for radio networks. In: Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN, pp. 63\u201368 (2002)","DOI":"10.1109\/ICPP.2001.952068"},{"issue":"2","key":"8_CR23","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s00446-011-0135-7","volume":"24","author":"C.C. Newport","year":"2011","unstructured":"Newport, C.C., Lynch, N.A.: Modeling radio networks. Distributed Computing\u00a024(2), 101\u2013118 (2011)","journal-title":"Distributed Computing"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Vaya, S.: Faster gossiping in bidirectional radio networks with large labels. CoRR abs\/1105.0479 (2011)","DOI":"10.1007\/978-3-642-24550-3_41"},{"issue":"2","key":"8_CR25","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1137\/0215032","volume":"15","author":"D.E. Willard","year":"1986","unstructured":"Willard, D.E.: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM Journal on Computing\u00a015(2), 468\u2013477 (1986)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35476-2_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T16:15:20Z","timestamp":1687882520000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35476-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642354755","9783642354762"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35476-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}