{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:02:19Z","timestamp":1783576939314,"version":"3.55.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T00:00:00Z","timestamp":1284595200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s00446-010-0118-0","type":"journal-article","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T03:54:45Z","timestamp":1284522885000},"page":"187-206","source":"Crossref","is-referenced-by-count":30,"title":["The abstract MAC layer"],"prefix":"10.1007","volume":"24","author":[{"given":"Fabian","family":"Kuhn","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nancy","family":"Lynch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Calvin","family":"Newport","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,9,16]]},"reference":[{"key":"118_CR1","unstructured":"80211 I: Wireless LAN MAC and Physical Layer Specifications June (1999)"},{"key":"118_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: On the complexity of radio communication. In: The Proceedings of the Symposium on Theory of Computing (1989)","DOI":"10.1145\/73007.73033"},{"key":"118_CR3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02259748","volume":"5","author":"R. Bar-Yehuda","year":"1991","unstructured":"Bar-Yehuda R., Goldreich O., Itai A.: Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection. Distrib. Comput. 5, 67\u201371 (1991)","journal-title":"Distrib. Comput."},{"issue":"1","key":"118_CR4","doi-asserted-by":"crossref","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. J. Comput. Syst. Sci. 45(1), 104\u2013126 (1992)","journal-title":"J. Comput. Syst. Sci."},{"issue":"12","key":"118_CR5","doi-asserted-by":"crossref","first-page":"1240","DOI":"10.1109\/TCOM.1985.1096245","volume":"33","author":"I. Chlamtac","year":"1985","unstructured":"Chlamtac I., Kutten S.: On broadcasting in radio networks: problem analysis and protocol design. IEEE Trans. Commun. 33(12), 1240\u20131246 (1985)","journal-title":"IEEE Trans. Commun."},{"key":"118_CR6","unstructured":"Chlebus, B.S., Gasieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. In: The Proceedings of the Symposium on Discrete Algorithms (2000)"},{"issue":"1","key":"118_CR7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s446-002-8028-1","volume":"15","author":"B.S. Chlebus","year":"2002","unstructured":"Chlebus B.S., Gasieniec L., Gibbons A., Pelc A., Rytter W.: Deterministic broadcasting in ad hoc radio networks. Distrib. Comput. 15(1), 27\u201338 (2002)","journal-title":"Distrib. Comput."},{"key":"118_CR8","doi-asserted-by":"crossref","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., Newport C., Nolte T.: Consensus and collision detectors in radio networks. Distrib. Comput. 21, 55\u201384 (2008)","journal-title":"Distrib. Comput."},{"issue":"1","key":"118_CR9","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.jpdc.2003.09.002","volume":"64","author":"A. Clementi","year":"2004","unstructured":"Clementi A., Monti A., Silvestri R.: Round Robin is optimal for fault-tolerant broadcasting on wireless networks. J. Parallel Distrib. Comput. 64(1), 89\u201396 (2004)","journal-title":"J. Parallel Distrib. Comput."},{"key":"118_CR10","unstructured":"Cornejo, A., Lynch, N., Viqar, S., Welch, J.: A neighbor discovery service using an abstract MAC layer. In: The Proceedings of the Allerton Conference on Communication, Control and Computing (2009)"},{"key":"118_CR11","unstructured":"Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: The Proceedings of the Symposium on Foundations of Computer Science (2003)"},{"key":"118_CR12","unstructured":"Das, B., Bharghavan, V.: Routing in ad-hoc networks using minimum connected dominating sets. In: The International Conference on Computer Communication (1997)"},{"issue":"2","key":"118_CR13","doi-asserted-by":"crossref","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. Discret. Math. 14(2), 207\u2013222 (2001)","journal-title":"SIAM J. Discret. Math."},{"key":"118_CR14","doi-asserted-by":"crossref","unstructured":"Gollakota, S., Katabi, D.: ZigZag decoding: combating hidden terminals in wireless networks. In: The Proceedings of the ACM SIGCOMM Conference (2008)","DOI":"10.1145\/1402958.1402977"},{"key":"118_CR15","doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Moscibroda, T., Wattenhofer, R.: Local broadcasting in the physical interference model. In: Joint Workshop on Foundations of Mobile Computing (2008)","DOI":"10.1145\/1400863.1400873"},{"issue":"2","key":"118_CR16","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1109\/18.825799","volume":"IT-46","author":"P. Gupta","year":"2000","unstructured":"Gupta P., Kumar P.R.: The capacity of wireless networks. IEEE Trans. Inf. Theory IT-46(2), 388\u2013404 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"118_CR17","doi-asserted-by":"crossref","unstructured":"Ingram, R., Radeva, T., Shields, P., Walter, J., Welch, J.: An asynchronous leader election algorithm for dynamic networks without perfect clocks. In: The Proceedings of the International Symposium on Parallel and Distributed Processing (2009)","DOI":"10.1109\/IPDPS.2009.5161028"},{"key":"118_CR18","doi-asserted-by":"crossref","unstructured":"Jurdzinski, T., Stachowiak, G.: Probabilistic algorithms for the wakeup problem in single-hop radio networks. In: Proceedings of the International Symposium on Algorithms and Computation (2002)","DOI":"10.1007\/3-540-36136-7_47"},{"key":"118_CR19","doi-asserted-by":"crossref","unstructured":"Kaynar, D.K., Lynch, N., Segala, R., Vaandrager, F.: The Theory of Timed I\/O Automata. Synthesis Lectures on Computer Science. Morgan Claypool Publishers, 2006. Also MIT-LCS-TR-917a","DOI":"10.2200\/S00006ED1V01Y200508CSL001"},{"key":"118_CR20","doi-asserted-by":"crossref","unstructured":"Khabbazian, M., Kowalski, D., Kuhn, F., Lynch, N.: The Cost of Global Broadcast using Abstract MAC Layers. Technical report, MIT Computer Science and Artificial Intelligence Laboratory (2010)","DOI":"10.1145\/1860684.1860690"},{"key":"118_CR21","doi-asserted-by":"crossref","unstructured":"Kowalski, D., Pelc, A.: Broadcasting in undirected ad hoc radio networks. In: The Proceedings of the International Symposium on Principles of Distributed Computing (2003)","DOI":"10.1145\/872035.872045"},{"key":"118_CR22","unstructured":"Kowalski, D., Pelc, A.: Time of radio broadcasting: adaptiveness vs. Obliviousness and Randomization vs. Determinism. In: Proceedings of the Colloquium on Structural Information and Communication Complexity (2003)"},{"issue":"4","key":"118_CR23","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(4), 870\u2013891 (2004)","journal-title":"SIAM J. Comput."},{"key":"118_CR24","unstructured":"Kowalski, D.R., Pelc, A.: Deterministic broadcasting time in radio networks of unknown topology. In: The Proceedings of the Symposium on Foundations of Computer Science (2002)"},{"issue":"1","key":"118_CR25","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1006\/jagm.2000.1147","volume":"39","author":"E. Kranakis","year":"2001","unstructured":"Kranakis E., Krizanc D., Pelc A.: Fault-tolerant broadcasting in radio networks. J. Algorithms 39(1), 47\u201367 (2001)","journal-title":"J. Algorithms"},{"key":"118_CR26","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Newport, C.: Brief announcement: hardness of broadcasting in wireless networks with unreliable communication. In: The Proceedings of the International Symposium on Principles of Distributed Computing (2009)","DOI":"10.1145\/1582716.1582794"},{"key":"118_CR27","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Newport, C.: The abstract MAC layer. In: The Proceedings of the International Symposium on Distributed Computing (2009)","DOI":"10.1007\/978-3-642-04355-0_9"},{"key":"118_CR28","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Newport, C., Oshman, R., Richa, A.: Broadcasting in Radio Networks with Unreliable Communication. Manuscript (2010)","DOI":"10.1145\/1835698.1835779"},{"key":"118_CR29","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Fast deterministic distributed maximal independent set computation on growth-bounded graphs. In: The Proceedings of the International Symposium on Distributed Computing (2005)","DOI":"10.1007\/11561927_21"},{"key":"118_CR30","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: Initializing newly deployed ad hoc and sensor networks. In: The Proceedings of the International Conference on Mobile Computing and Networking (2004)","DOI":"10.1145\/1023720.1023746"},{"key":"118_CR31","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: Fault-tolerant clustering in ad hoc and sensor networks. In: The IEEE International Conference on Distributed Computing Systems (2006)"},{"key":"118_CR32","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: Maximal independent sets in radio networks. In: The Proceedings of the International Symposium on Principles of Distributed Computing (2005)","DOI":"10.1145\/1073814.1073842"},{"key":"118_CR33","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: The complexity of connectivity in wireless networks. In: The Proceedings of Conference on Computer Communications (2006)","DOI":"10.1109\/INFOCOM.2006.23"},{"issue":"9","key":"118_CR34","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1109\/TCOM.1985.1096405","volume":"33","author":"R. Nelson","year":"1985","unstructured":"Nelson R., Kleinrock L.: Spatial TDMA: a collision-free multihop channel access protocol. IEEE Trans. Commun. 33(9), 934\u2013944 (1985)","journal-title":"IEEE Trans. Commun."},{"key":"118_CR35","doi-asserted-by":"crossref","unstructured":"Scheideler, C., Richa, A., Santi, P.: An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model. In: The ACM International Symposium on Mobile Ad Hoc Networking and Computing (2008)","DOI":"10.1145\/1374618.1374632"},{"key":"118_CR36","unstructured":"Walter, J., Cao, G., Mohanty, M.: A k-mutual exclusion algorithm for wireless ad hoc networks. In: The Proceedings of the Workshop on Principles of Mobile Computing (2001)"},{"issue":"6","key":"118_CR37","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1023\/A:1012363200403","volume":"7","author":"J. Walter","year":"2001","unstructured":"Walter J., Welch J., Vaidya N.: A mutual exclusion algorithm for ad hoc mobile networks. Wirel. Netw. 7(6), 585\u2013600 (2001)","journal-title":"Wirel. Netw."},{"issue":"2","key":"118_CR38","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/B:MONE.0000013625.87793.13","volume":"9","author":"P.-J. Wan","year":"2004","unstructured":"Wan P.-J., Alzoubi K., Frieder O.: Distributed construction of connected dominating set in wireless ad hoc networks. Mobile Netw. Appl. 9(2), 141\u2013149 (2004)","journal-title":"Mobile Netw. Appl."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-010-0118-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-010-0118-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-010-0118-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T15:42:19Z","timestamp":1559662939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-010-0118-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,16]]},"references-count":38,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["118"],"URL":"https:\/\/doi.org\/10.1007\/s00446-010-0118-0","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,16]]}}}