{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T04:10:54Z","timestamp":1789877454479,"version":"4.0.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319530574","type":"print"},{"value":"9783319530581","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53058-1_2","type":"book-chapter","created":{"date-parts":[[2017,1,23]],"date-time":"2017-01-23T09:01:41Z","timestamp":1485162101000},"page":"16-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC"],"prefix":"10.1007","author":[{"given":"Kokouvi","family":"Hounkanli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Avery","family":"Miller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,1,24]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.) DISC 2011. LNCS, vol. 6950, pp. 32\u201350. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-24100-0_3"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-22212-2_9","volume-title":"Structural Information and Communication Complexity","author":"L Anantharamu","year":"2011","unstructured":"Anantharamu, L., Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Medium access control for adversarial channels with jamming. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol. 6796, pp. 89\u2013100. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-22212-2_9"},{"key":"2_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing","author":"H Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing. John Wiley and Sons Inc., Chichester (2004)"},{"issue":"4","key":"2_CR4","doi-asserted-by":"publisher","first-page":"24:1","DOI":"10.1145\/2635818","volume":"10","author":"B Awerbuch","year":"2014","unstructured":"Awerbuch, B., Richa, A.W., Scheideler, C., Schmid, S., Zhang, J.: Principles of robust medium access and an application to leader election. ACM Trans. Algorithms 10(4), 24:1\u201324:26 (2014)","journal-title":"ACM Trans. Algorithms"},{"key":"2_CR5","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 radio networks: an exponential gap between determinism and randomization. J. Comput. Syst. Sci. 45, 104\u2013126 (1992)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/11523468_29","volume-title":"Automata, Languages and Programming","author":"BS Chlebus","year":"2005","unstructured":"Chlebus, B.S., G\u0105sieniec, L., Kowalski, D.R., Radzik, T.: On the wake-up problem in radio networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 347\u2013359. Springer, Heidelberg (2005). doi:10.1007\/11523468_29"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-642-15763-9_24","volume-title":"Distributed Computing","author":"BS Chlebus","year":"2010","unstructured":"Chlebus, B.S., Kowalski, D.R., Strojnowski, M.: Scalable quantum consensus for crash failures. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 236\u2013250. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-15763-9_24"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s00446-008-0056-2","volume":"21","author":"G Chockler","year":"2008","unstructured":"Chockler, G., Demirbas, M., Gilbert, S., Lynch, N.A., Newport, C.C., Nolte, T.: Consensus and collision detectors in radio networks. Distrib. Comput. 21, 55\u201384 (2008)","journal-title":"Distrib. Comput."},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). doi:10.1007\/978-3-642-15763-9_15"},{"key":"2_CR10","unstructured":"Czumaj, A., Davis, P.: Communicating with beeps, arXiv:1505.06107 [cs.DC] (2015)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 709\u2013718 (2001)","DOI":"10.1145\/383962.384040"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: Proceedings of the 44th IEEE Symposium on Foundations of Computer Science (FOCS 2003), pp. 492\u2013501 (2003)","DOI":"10.1109\/SFCS.2003.1238222"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-642-04355-0_51","volume-title":"Distributed Computing","author":"J Czyzowicz","year":"2009","unstructured":"Czyzowicz, J., G\u0105sieniec, L., Kowalski, D.R., Pelc, A.: Consensus and mutual exclusion in a multiple access channel. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 512\u2013526. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-04355-0_51"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). doi:10.1007\/978-3-662-45174-8_15"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/S0895480100376022","volume":"14","author":"L Gasieniec","year":"2001","unstructured":"Gasieniec, L., Pelc, A., Peleg, D.: The wakeup problem in synchronous broadcast systems. SIAM J. Discrete Math. 14, 207\u2013222 (2001)","journal-title":"SIAM J. Discrete Math."},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Haeupler, B.: Near optimal leader election in multi-hop radio networks. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), pp. 748\u2013766 (2013)","DOI":"10.1137\/1.9781611973105.54"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Gilbert, S., Kowalski, D.R.: Distributed agreement with optimal communication complexity. In: Proceedings of the 21st ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 965\u2013977 (2010)","DOI":"10.1137\/1.9781611973075.78"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/3-540-08755-9_9","volume-title":"Operating Systems","author":"JN Gray","year":"1978","unstructured":"Gray, J.N.: Notes on data base operating systems. In: Bayer, R., Graham, R.M., Seegm\u00fcller, G. (eds.) Operating Systems an Advanced Course. LNCS, vol. 60, pp. 393\u2013481. Springer, Heidelberg (1978). doi:10.1007\/3-540-08755-9_9"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1145\/3828.214125","volume":"32","author":"AG Greenberg","year":"1985","unstructured":"Greenberg, A.G., Winograd, S.: A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels. J. ACM 32, 589\u2013596 (1985)","journal-title":"J. ACM"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-642-41527-2_22","volume-title":"Distributed Computing","author":"B Huang","year":"2013","unstructured":"Huang, B., Moscibroda, T.: Conflict resolution and membership problem in beeping channels. In: Afek, Y. (ed.) DISC 2013. LNCS, vol. 8205, pp. 314\u2013328. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-41527-2_22"},{"key":"2_CR21","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publ. Inc., San Francisco (1996)"},{"key":"2_CR22","unstructured":"M\u00e9tivier, Y., Robson, J.M., Zemmari, A.: On distributed computing with beeps, arXiv:1507.02721 [cs.DC] (2015)"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1016\/j.jpdc.2009.01.001","volume":"69","author":"Y Moses","year":"2009","unstructured":"Moses, Y., Raynal, M.: Revisiting simultaneous consensus with crash failures. J. Parallel Distrib. Comput. 69, 400\u2013409 (2009)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"2_CR24","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/2678280","volume":"58","author":"S Navlakha","year":"2014","unstructured":"Navlakha, S., Bar-Joseph, Z.: Distributed information processing in biological and computational systems. Commun. ACM 58(1), 94\u2013102 (2014)","journal-title":"Commun. ACM"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"MC Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27, 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"2_CR26","volume-title":"Fault-Tolerant Agreement in Synchronous Distributed Systems","author":"M Raynal","year":"2010","unstructured":"Raynal, M.: Fault-Tolerant Agreement in Synchronous Distributed Systems. Morgan & Claypool Publishers, San Francisco (2010)"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/BFb0028994","volume-title":"STACS 89","author":"N Santoro","year":"1989","unstructured":"Santoro, N., Widmayer, P.: Time is not a healer. In: Monien, B., Cori, R. (eds.) STACS 1989. LNCS, vol. 349, pp. 304\u2013313. Springer, Heidelberg (1989). doi:10.1007\/BFb0028994"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Santoro, N., Widmayer, P.: Distributed function evaluation in presence of transmission faults. In: Proceedings of the International Symposium on Algorithms (SIGAL 1990), pp. 358\u2013367 (1990)","DOI":"10.1007\/3-540-52921-7_85"},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1137\/0215032","volume":"15","author":"DE Willard","year":"1986","unstructured":"Willard, D.E.: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM J. Comput. 15, 468\u2013477 (1986)","journal-title":"SIAM J. Comput."},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Yu, Y., Jia, L., Yu, D., Li, G., Cheng, X.: Minimum connected dominating set construction in wireless networks under the beeping model. In: Proceedings of the IEEE Conference on Computer Communications (INFOCOM 2015), pp. 972\u2013980 (2015)","DOI":"10.1109\/INFOCOM.2015.7218469"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53058-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T18:38:47Z","timestamp":1749926327000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-53058-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319530574","9783319530581"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53058-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"24 January 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOSENSORS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/conferences.au.dk\/algo16\/algosensors\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}