{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T04:11:03Z","timestamp":1789877463348,"version":"4.0.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319483139","type":"print"},{"value":"9783319483146","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48314-6_19","type":"book-chapter","created":{"date-parts":[[2016,11,3]],"date-time":"2016-11-03T15:01:04Z","timestamp":1478185264000},"page":"291-306","source":"Crossref","is-referenced-by-count":2,"title":["Asynchronous Broadcasting with Bivalent Beeps"],"prefix":"10.1007","author":[{"given":"Kokouvi","family":"Hounkanli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,11,4]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/978-3-642-24100-0_3","volume-title":"Distributed Computing","author":"Y Afek","year":"2011","unstructured":"Afek, Y., Alon, N., Bar-Joseph, Z., Cornejo, A., Haeupler, B., Kuhn, F.: Beeping a maximal independent set. In: Peleg, D. (ed.) Distributed Computing. LNCS, vol. 6950, pp. 32\u201350. Springer, Heidelberg (2011)"},{"key":"19_CR2","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1145\/77600.77618","volume":"37","author":"B Awerbuch","year":"1990","unstructured":"Awerbuch, B., Goldreich, O., Peleg, D., Vainish, R.: A trade-off between information and communication in broadcast protocols. J. ACM 37, 238\u2013256 (1990)","journal-title":"J. ACM"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/978-3-540-92221-6_21","volume-title":"Principles of Distributed Systems","author":"T Calamoneri","year":"2008","unstructured":"Calamoneri, T., Fusco, E.G., Pelc, A.: Impact of information on the complexity of asynchronous radio broadcasting. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol. 5401, pp. 311\u2013330. Springer, Heidelberg (2008)"},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.tcs.2007.03.057","volume":"383","author":"BS Chlebus","year":"2007","unstructured":"Chlebus, B.S., Rokicki, M.A.: Centralized asynchronous broadcast in radio networks. Theor. Comput. Sci. 383, 5\u201322 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR5","doi-asserted-by":"crossref","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. Alg. 43, 177\u2013189 (2002)","journal-title":"J. Alg."},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/978-3-642-15763-9_15","volume-title":"Distributed Computing","author":"A Cornejo","year":"2010","unstructured":"Cornejo, A., Kuhn, F.: Deploying wireless networks with beeps. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 148\u2013162. Springer, Heidelberg (2010)"},{"key":"19_CR7","unstructured":"Czumaj, A., Davis, P.: Communicating with beeps [cs.DC] (2015). arXiv:1505.06107"},{"key":"19_CR8","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1002\/rsa.3240010406","volume":"1","author":"U Feige","year":"1990","unstructured":"Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. Random Struct. Alg. 1, 447\u2013460 (1990)","journal-title":"Random Struct. Alg."},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/978-3-662-45174-8_15","volume-title":"Distributed Computing","author":"K-T F\u00f6rster","year":"2014","unstructured":"F\u00f6rster, K.-T., Seidel, J., Wattenhofer, R.: Deterministic leader election in multi-hop beeping networks. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 212\u2013226. Springer, Heidelberg (2014)"},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"P Fraigniaud","year":"1994","unstructured":"Fraigniaud, P., Lazard, E.: Methods and problems of communication in usual networks. Disc. Appl. Math. 53, 79\u2013133 (1994)","journal-title":"Disc. Appl. Math."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Haeupler, B.: Near optimal leader election in multi-hop radio networks. In: Proceedings of 24th ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), pp. 748\u2013766","DOI":"10.1137\/1.9781611973105.54"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-662-48653-5_3","volume-title":"Distributed Computing","author":"S Gilbert","year":"2015","unstructured":"Gilbert, S., Newport, C.: The computational power of beeps. In: Moses, Y., et al. (eds.) DISC 2015. LNCS, vol. 9363, pp. 31\u201346. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48653-5_3"},{"key":"19_CR13","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"SM Hedetniemi","year":"1988","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. Networks 18, 319\u2013349 (1988)","journal-title":"Networks"},{"key":"19_CR14","unstructured":"Hounkanli, K., Miller, A., Pelc, A.: Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC. CoRR abs\/1508.06583 (2015)"},{"key":"19_CR15","volume-title":"Algorithmic Foundations of Communication in Radio Networks","author":"D Kowalski","year":"2011","unstructured":"Kowalski, D.: Algorithmic Foundations of Communication in Radio Networks. Morgan & Claypool Publishers, California (2011)"},{"key":"19_CR16","doi-asserted-by":"crossref","first-page":"870","DOI":"10.1137\/S0097539702419339","volume":"33","author":"D Kowalski","year":"2004","unstructured":"Kowalski, D., Pelc, A.: Time of deterministic broadcasting in radio networks with local knowledge. SIAM J. Comput. 33, 870\u2013891 (2004)","journal-title":"SIAM J. Comput."},{"key":"19_CR17","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1137\/S0097539794279109","volume":"27","author":"E Kushilevitz","year":"1998","unstructured":"Kushilevitz, E., Mansour, Y.: An Omega(D log (N\/D)) lower bound for broadcast in radio networks. SIAM J. Comput. 27, 702\u2013712 (1998)","journal-title":"SIAM J. Comput."},{"key":"19_CR18","unstructured":"M\u00e9tivier, Y., Robson, J.M., Zemmari, A.: On distributed computing with beeps, CoRR abs\/1507.02721 (2015)"},{"key":"19_CR19","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<143::AID-NET3>3.0.CO;2-N","volume":"28","author":"A Pelc","year":"1996","unstructured":"Pelc, A.: Fault-tolerant broadcasting and gossiping in communication networks. Networks 28, 143\u2013156 (1996)","journal-title":"Networks"},{"key":"19_CR20","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s00446-007-0021-5","volume":"19","author":"A Pelc","year":"2007","unstructured":"Pelc, A.: Activating anonymous ad hoc radio networks. Distrib. Comput. 19, 361\u2013371 (2007)","journal-title":"Distrib. Comput."},{"key":"19_CR21","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1137\/0210052","volume":"10","author":"PJ Slater","year":"1981","unstructured":"Slater, P.J., Cockayne, E.J., Hedetniemi, S.T.: Information dissemination in trees. SIAM J. Comput. 10, 692\u2013701 (1981)","journal-title":"SIAM J. Comput."},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Yu, J., Jia, L., Yu, D., Li, G., Cheng, X.: Minimum connected dominating set construction in wireless networks under the beeping model. In: Proceedings of IEEE Conference on Computer Communications, (INFOCOM 2015), pp. 972\u2013980 (2015)","DOI":"10.1109\/INFOCOM.2015.7218469"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48314-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T02:43:48Z","timestamp":1498358628000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48314-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319483139","9783319483146"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48314-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}